Skip to main content
Log in

Compression Algorithm for Implicit 3D B-Spline Solids

  • Published:
Communications in Mathematics and Statistics Aims and scope Submit manuscript

Abstract

Due to advantages in solid modeling with complex geometry and its ideal suitability for 3D printing, the implicit representation has been widely used in recent years. The demand for free-form shapes makes the implicit tensor-product B-spline representation attract more and more attention. However, it is an important challenge to deal with the storage and transmission requirements of enormous coefficient tensor. In this paper, we propose a new compression framework for coefficient tensors of implicit 3D tensor-product B-spline solids. The proposed compression algorithm consists of four steps, i.e., preprocessing, block splitting, using a lifting-based 3D discrete wavelet transform, and coding with 3D set partitioning in hierarchical trees algorithm. Finally, we manage to lessen the criticism of the implicit tensor-product B-spline representation of surface for its redundancy store of 3D coefficient tensor. Experimental results show that the proposed compression framework not only achieves satisfactory reconstruction quality and considerable compression ratios, but also supports progressive transmissions and random access by employing patch-wise coding strategy.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Bloomenthal, J., Bajaj, C.: Introduction to Implicit Surfaces. Morgan Kaufmann, Burlington (1997)

    MATH  Google Scholar 

  2. Bowyer, A.: SVLIS: Set-Theoretic Kernel Modeller. Information Geometers, Winchester (1995)

    Google Scholar 

  3. Chen, W.T.F.: A fast and adaptive surface reconstruction algorithm based on the implicit tensor-product B-spline (ITPBS) surfaces. In: Tong, W., Chen, F., Feng, Y. (eds.) Proceedings of The Seventh China-Japan Seminar on Numerical Mathematics, pp. 161–178, (2006).

  4. Cignoni, P., Rocchini, C., Scopigno, R.: Metro: measuring error on simplified surfaces. In: Computer Graphics Forum. 17, 167–174, Wiley Online Library (1998)

  5. Cohen, A., Daubechies, I., Feauveau, J.-C.: Biorthogonal bases of compactly supported wavelets. Commun. Pure Appl. Math. 45(5), 485–560 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Daubechies, I., Sweldens, W.: Factoring wavelet transforms into lifting steps. J. Fourier Anal. Appl. 4(3), 247–269 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Group, D. M.: Hyperfun. http://hyperfun.org/

  8. Hoffmann, C.M.: Implicit curves and surfaces in CAGD. IEEE Comput. Graph. Appl. 13(1), 79–88 (1993)

    Article  Google Scholar 

  9. Huang, P., Wang, C.C., Chen, Y.: Intersection-free and topologically faithful slicing of implicit solid. J. Comput. Inf. Sci. Eng. 13(2), 021009 (2013)

    Article  Google Scholar 

  10. John, A.E.: Anton. 3Dprinteros. https://cloud.3dprinteros.com/

  11. Lorensen, W.E., Cline, H.E.: Marching cubes: a high resolution 3D surface construction algorithm. In: ACM Siggraph Computer Graphics, 21, 163–169. ACM (1987)

  12. Pasko, A., Adzhiev, V., Sourin, A., Savchenko, V.: Function representation in geometric modeling: concepts, implementation and applications. Vis. Comput. 11(8), 429–446 (1995)

    Article  Google Scholar 

  13. Said, A., Pearlman, W.A.: A new, fast, and efficient image codec based on set partitioning in hierarchical trees. IEEE Trans. Circuits Syst. Video Technol. 6(3), 243–250 (1996)

    Article  Google Scholar 

  14. Sayood, K.: Introduction to Data Compression. Newnes, Oxford (2012)

    MATH  Google Scholar 

  15. Schmidt, R.: Interactive modeling with implicit surfaces. Ph.D. thesis, Masters thesis, Department of Computer Science, University of Calgary (2006)

  16. Sweldens, W.: Lifting scheme: a new philosophy in biorthogonal wavelet constructions. In: SPIE’s 1995 International Symposium on Optical Science, Engineering, and Instrumentation, pp. 68–79. International Society for Optics and Photonics (1995)

  17. Sweldens, W.: The lifting scheme: a custom-design construction of biorthogonal wavelets. Appl. Comput. Harmon. Anal. 3(2), 186–200 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  18. Sweldens, W.: The lifting scheme: a construction of second generation wavelets. SIAM J. Math. Anal. 29(2), 511–546 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  19. Uformia. Symvol for rhino. http://uformia.com/products/symvol-for-rhino/

  20. Wang, J., Yang, Z., Jin, L., Deng, J., Chen, F.: Parallel and adaptive surface reconstruction based on implicit PHT-splines. Comput. Aided Geom. Des. 28(8), 463–474 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We would like to thank the anonymous reviewers and our laboratory group for helpful discussions and comments. The work is supported by the NSF of China (No. 11771420) and the Fundamental Research Funds for the Central Universities (WK 001046003).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhouwang Yang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Song, Y., Luo, Y., Liu, Y. et al. Compression Algorithm for Implicit 3D B-Spline Solids. Commun. Math. Stat. 6, 119–140 (2018). https://doi.org/10.1007/s40304-018-0128-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40304-018-0128-y

Keywords

Mathematics Subject Classification

Navigation