“Progressive encoding of complex isosurfaces” by Lee, Desbrun and Schröder

  • ©Haeyoung Lee, Mathieu Desbrun, and Peter Schröder

Conference:


Type:


Title:

    Progressive encoding of complex isosurfaces

Presenter(s)/Author(s):



Abstract:


    We present a progressive encoding technique specifically designed for complex isosurfaces. It achieves better rate distortion performance than all standard mesh coders, and even improves on all previous single rate isosurface coders. Our novel algorithm handles isosurfaces with or without sharp features, and deals gracefully with high topologic and geometric complexity. The inside/outside function of the volume data is progressively transmitted through the use of an adaptive octree, while a local frame based encoding is used for the fine level placement of surface samples. Local patterns in topology and local smoothness in geometry are exploited by context-based arithmetic encoding, allowing us to achieve an average of 6.10 bits per vertex (b/v) at very low distortion. Of this rate only 0.65 b/v are dedicated to connectivity data: this improves by 24% over the best previous single rate isosurface encoder.

References:


    1. ALLIEZ, P., AND DESBRUN, M. 2001. Progressive Encoding for Lossless Transmission of 3D Meshes. In Proc. of SIGGRAPH, 198–205. Google Scholar
    2. BAJAJ, C. L., PASCUCCI, V., AND ZHUANG, G. 1999. Progressive Compression and Transmission of Arbitrary Triangular Meshes. In Proc. of IEEE Visualization, 307–316. Google Scholar
    3. BLOOMENTHAL, J. 1997. Introduction to Implicit Surfaces. Morgan Kaufmann. Google Scholar
    4. CIGNONI, P., ROCCHINI, C., AND SCOPIGNO, R. 1998. Metro: Measuring Error on Simplified Surfaces. Computer Graphics Forum 17, 2, 167–174.Google Scholar
    5. DEERING, M. 1995. Geometry Compression. In Proc. of SIGGRAPH, 13–20. Google Scholar
    6. GANDOIN, P.-M., AND DEVILLERS, O. 2002. Progressive Lossless Compression of Arbitrary Simplicial Complexes. ACM Trans. on Graphics 21, 3, 372–379. Google ScholarDigital Library
    7. GU, X., GORTLER, S. J., AND HOPPE, H. 2002. Geometry Images. ACM Trans. on Graphics 21, 3, 355–361. Google ScholarDigital Library
    8. HOPPE, H. 1996. Progressive Meshes. In Proc. of SIGGRAPH, 99–108. Google Scholar
    9. JU, T., LOSASSO, F., SCHAEFER, S., AND WARREN, J. 2002. Dual Contouring of Hermite Data. ACM Trans. on Graphics 21, 3, 339–346. Google ScholarDigital Library
    10. KHODAKOVSKY, A., SCHRÖDER, P., AND SWELDENS, W. 2000. Progressive Geometry Compression. In Proc. of SIGGRAPH, 271–278. Google ScholarDigital Library
    11. KOBBELT, L. P., BOTSCH, M., SCHWANECKE, U., AND SEIDEL, H.-P. 2001. Feature Sensitive Surface Extraction from Volume Data. In Proc. of SIGGRAPH, 57–66. Google Scholar
    12. LACHAUD, J.-O. 1996. Topologically Defined Iso-surfaces. In Proc. 6th Discrete Geometry for Computer Imagery, Springer-Verlag, Berlin, vol. 1176, 245–256. Google ScholarDigital Library
    13. LANEY, D., BERTRAM, M., DUCHAINEAU, M., AND MAX, N. 2002. Multiresolution Distance Volumes for Progressive Surface Compression. In Proc. of the 1st Intl. Symp. on 3D Data Processing Visualization and Transmission, 470–479.Google Scholar
    14. LEE, H., ALLIEZ, P., AND DESBRUN, M. 2002. Angle-Analyzer: A Triangle-Quad Mesh Codec. Computer Graphics Forum (Proc. of Eurographics) 21, 3, 383–392.Google ScholarCross Ref
    15. LINDSTROM, P. 2000. Out-of-Core Simplification of Large Polygonal Models. In Proc. of SIGGRAPH, 259–262. Google ScholarDigital Library
    16. LORENSEN, W., AND CLINE, H. 1987. Marching Cubes: A High Resolution 3D Surface Construction Algorithm. Computer Graphics (Proc. of SIGGRAPH) 21, 4, 163–169. Google ScholarDigital Library
    17. PAJAROLA, R., AND ROSSIGNAC, J. 2000. Compressed Progressive Meshes. IEEE Trans. on Visualization and Computer Graphics 6, 1, 79–93. Google ScholarDigital Library
    18. PENNEBAKER, W. B., AND MITCHELL, J. L. 1993. JPEG: Still Image Date Data Compression Standard. Van Nostrand Reinhold. Google ScholarDigital Library
    19. ROSSIGNAC, J. 1999. EdgeBreaker: Connectivity Compression for Triangle Meshes. IEEE Trans. on Visualization and Computer Graphics 5, 1, 47–61. Google ScholarDigital Library
    20. SAMET, H., AND KOCHUT, A. 2002. Octree Approximation and Compression Methods. In Proc. of the 1st Intl. Symp. on 3D Data Processing Visualization and Transmission, 460–469.Google Scholar
    21. SAUPE, D., AND KUSKA, J.-P. 2001. Compression of Isosurfaces for Structured Volumes. In Proc. of Vision, Modeling and Visualization, 333–340. Google Scholar
    22. SAUPE, D., AND KUSKA, J.-P. 2002. Compression of Isosurfaces for Structured Volumes with Context Modelling. In Proc. of the 1st Intl. Symp. on 3D Data Processing Visualization and Transmission, 384–390.Google Scholar
    23. SCHAEFER, S., AND WARREN, J. 2002. Dual Contouring: “The Secret Sauce”. Tech. rep., Rice University.Google Scholar
    24. TAUBIN, G., AND ROSSIGNAC, J. 1998. Geometry Compression Through Topological Surgery. ACM Trans. on Graphics 17, 2, 84–115. Google ScholarDigital Library
    25. TAUBIN, G., GUEZIEC, A., HORN, W., AND LAZARUS, F. 1998. Progressive Forest Split Compression. In Proc. of SIGGRAPH, 123–132. Google Scholar
    26. TAUBIN, G. 2002. BLIC: Bi-Level Isosurface Compression. In Proc. of IEEE Visualization, 451–458. Google Scholar
    27. TOUMA, C., AND GOTSMAN, C. 1998. Triangle Mesh Compression. In Proc. of Graphics Interface, 26–34.Google Scholar
    28. WHEELER, F., 1996. Adaptive Arithmetic Coding Source Code. http://www.cipr.rpi.edu/~wheeler/ac.Google Scholar
    29. YANG, S.-N., AND WU, T.-S. 2002. Compressing Isosurfaces Generated with Marching Cubes. The Visual Computer 18, 1, 54–67.Google ScholarCross Ref
    30. ZHANG, X., BAJAJ, C., BLANKE, Q., AND FUSSELL, D. 2001. Scalable Isosurface Visualization of Massive Datasets on COTS Clusters. In Proc. of IEEE Symp. on Parallel and Large Data Visualization and Graphics, 51–58. Google Scholar


ACM Digital Library Publication: