Progressive forest split compression
Gabriel Taubin, Andre P. Gueziec, William Horn et al. · ACM SIGGRAPH Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH) · 1998
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progressive and highly compressed form. As in the Progressive Mesh (PM) method of Hoppe, a triangular mesh is represented as a low resolution polygonal model followed by a sequence of refinement operations, each one specifying how to add triangles and vertices to the previous level of detail to obtain a new level. The PFS format shares with PM and other refinement schemes the ability to smoothly interpolate between consecutive levels of detail. However, it achieves much higher compression ratios than PM by using a more complex refinement operation which can, at the expense of reduced granularity, be encoded more efficiently. A forest split operation doubling the number n of triangles of a mesh requires a maximum of approximately 3:5n bits to represent the connectivity changes, as opposed to approximately #5 + log 2 #n## n bits in PM. We describe
Cited by 273 works. doi:10.1145/280814.280834
Authors
References
- Recursively generated B-spline surfaces on arbitrary topological meshes
- Progressive meshes
- Mesh optimization
- Behaviour of recursive division surfaces near extraordinary points
- A signal processing approach to fair surface design
- Multiresolution analysis of arbitrary meshes
- Multi-resolution 3D approximations for rendering complex scenes
- Smooth Subdivision Surfaces Based on Triangles
- Geometry compression
- Geometric compression through topological surgery