Compression Algorithm for Implicit 3D B-Spline Solids

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.

[1]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[2]  Alexei Sourin,et al.  Function representation in geometric modeling: concepts, implementation and applications , 1995, The Visual Computer.

[3]  William A. Pearlman,et al.  A new, fast, and efficient image codec based on set partitioning in hierarchical trees , 1996, IEEE Trans. Circuits Syst. Video Technol..

[4]  I. Daubechies,et al.  Biorthogonal bases of compactly supported wavelets , 1992 .

[5]  Jun Wang,et al.  Parallel and adaptive surface reconstruction based on implicit PHT-splines , 2011, Comput. Aided Geom. Des..

[6]  Christoph M. Hoffmann,et al.  Implicit curves and surfaces in CAGD , 1993, IEEE Computer Graphics and Applications.

[7]  Wim Sweldens,et al.  The lifting scheme: a construction of second generation wavelets , 1998 .

[8]  Charlie C. L. Wang,et al.  Intersection-Free and Topologically Faithful Slicing of Implicit Solid , 2013, J. Comput. Inf. Sci. Eng..

[9]  Khalid Sayood,et al.  Introduction to Data Compression , 1996 .

[10]  I. Daubechies Orthonormal bases of compactly supported wavelets , 1988 .

[11]  Wim Sweldens,et al.  Lifting scheme: a new philosophy in biorthogonal wavelet constructions , 1995, Optics + Photonics.

[12]  I. Daubechies,et al.  Factoring wavelet transforms into lifting steps , 1998 .

[13]  W. Sweldens The Lifting Scheme: A Custom - Design Construction of Biorthogonal Wavelets "Industrial Mathematics , 1996 .

[14]  Brian Wyvill,et al.  Introduction to Implicit Surfaces , 1997 .

[15]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.