QSplat
Szymon M. Rusinkiewicz, Marc Levoy · ACM SIGGRAPH Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH) · 2000
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing and progressively displaying these meshes that combines a multiresolution hierarchy based on bounding spheres with a rendering system based on points. A single data structure is used for view frustum culling, backface culling, level-of-detail selection, and rendering. The representation is compact and can be computed quickly, making it suitable for large data sets. Our implementation, written for use in a large-scale 3D digitization project, launches quickly, maintains a user-settable interactive frame rate regardless of object complexity or camera position, yields reasonable image quality during motion, and refines progressively when idle to a high final image quality. We have demonstrated the system on scanned models containing hundreds of millions of samples.
Cited by 969 works. doi:10.1145/344779.344940 Open-access PDF
Authors
References
- A Method for the Construction of Minimum-Redundancy Codes
- Particle Systems—a Technique for Modeling a Class of Fuzzy Objects
- A volumetric method for building complex models from range images
- Progressive meshes
- The Digital Michelangelo Project
- Multiresolution analysis of arbitrary meshes
- Towards an interactive high visual complexity animation system
- Multi-resolution 3D approximations for rendering complex scenes
- Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments
- A 3-dimensional representation for fast rendering of complex scenes