Advertisement

Progressive Compression of Geometry Information with Smooth Intermediate Meshes

  • Taejung Park
  • Haeyoung Lee
  • Chang-hun Kim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4478)

Abstract

We present a new geometry compression algorithm for manifold 3D meshes based on octree coding. For a given mesh, regular volume grids are built with an adaptive octree. For each grid point, a binary sign, which indicates inside or outside of the mesh, is generated based on the distance to the mesh. In each leaf cell having a vertex, a least square fitting plane is created for a localized geometry range with signs. Finally, quantized geometry information is locally encoded. We demonstrate that the octree with signs can be used to predict the vertex positions. As a result, the proposed method generates competitive bitrates compared to the current state-of-art progressive geometry coder. Our method also shows better rate-distortion performance during decompression or transmission with improved smoothness.

Keywords

Leaf Node Compression Rate Geometry Information Connectivity Information Vertex Position 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lee, H., Alliez, P., Desbrun, M.: Angle-Analyzer: A Triangle-Quad Mesh Codec. In: Eurographics’02 Conference Proceedings (2002)Google Scholar
  2. 2.
    Kaelberer, F., Polthier, K., Reitebuch, U., Wardetzky, M.: FreeLence - Coding with Free Valences. Computer Graphics Forum (Eurographics 2005) (2005)Google Scholar
  3. 3.
    Touma, C., Gotsman, C.: Triangle Mesh Compression. In: Graphics Interface 98 Conference Proceedings, pp. 26–34 (1998)Google Scholar
  4. 4.
    Alliez, P., Desbrun, M.: Valence-Driven Connectivity Encoding for 3D Meshes. In: EG 2001 Proceedings 20, 480–489 (2001)Google Scholar
  5. 5.
    Peng, J., Kuo, C.C.J.: Geometry-guided progressive lossless 3D mesh coding with octree decomposition. ACM Transactions on Graphics 24, 609–616 (2005)CrossRefGoogle Scholar
  6. 6.
    Pierre-Marie, G., Olivier, D.: Progressive lossless compression of arbitrary simplicial complexes. In: Proceedings of the 29th annual conference on Computer graphics and interactive techniques, San Antonio, Texas, ACM Press, New York (2002)Google Scholar
  7. 7.
    Tao, J., Frank, L., Scott, S., Joe, W.: Dual contouring of hermite data. ACM Trans. Graph 21, 339–346 (2002)Google Scholar
  8. 8.
    Alliez, P., Desbrun, M.: Progressive compression for lossless transmission of triangle meshes. In: Proceedings of the 28th annual conference on Computer graphics and interactive techniques, ACM Press, New York (2001)Google Scholar
  9. 9.
    Lee, H., Desbrun, M., Schroeder, P.: Progressive Encoding of Complex Isosurfaces. ACM Transactions on Graphics 22, 471–476 (2003)CrossRefGoogle Scholar
  10. 10.
    Wheeler, F.W.: Adaptive Arithmetic Coding Source CodeGoogle Scholar
  11. 11.
    Gandoin, P.-M., Devillers, O.: Progressive lossless compression of arbitrary simplicial complexes. In: Proceedings of the 29th annual conference on Computer graphics and interactive techniques, San Antonio, Texas, ACM Press, New York (2002)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Taejung Park
    • 1
  • Haeyoung Lee
    • 2
  • Chang-hun Kim
    • 1
  1. 1.Computer Graphics Lab., Dept. Of Computer Science and Engineering, Korea University, Seoul, 136-701Korea
  2. 2.Hongik University, 72-1 Sangsudong, Mapogu, Seoul, 121-719Korea

Personalised recommendations