Variational shape approximation
David Cohen‐Steiner, Pierre Alliez, Mathieu Desbrun · ACM Transactions on Graphics · 2004
A method for concise, faithful approximation of complex 3D datasets is key to reducing the computational cost of graphics applications. Despite numerous applications ranging from geometry compression to reverse engineering, efficiently capturing the geometry of a surface remains a tedious task. In this paper, we present both theoretical and practical contributions that result in a novel and versatile framework for geometric approximation of surfaces. We depart from the usual strategy by casting shape approximation as a variational geometric partitioning problem. Using the concept of geometric proxies, we drive the distortion error down through repeated clustering of faces into best-fitting regions. Our approach is entirely discrete and error-driven, and does not require parameterization or local estimations of differential quantities. We also introduce a new metric based on normal deviation, and demonstrate its superior behavior at capturing anisotropy.
Cited by 642 works. doi:10.1145/1015706.1015817 Open-access PDF
Authors
References
- Least squares quantization in PCM
- Progressive meshes
- Level Set Methods and Dynamic Implicit Surfaces
- Mesh optimization
- Re-tiling polygonal surfaces
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Reverse engineering of geometric models—an introduction
- MAPS
- Modern Differential Geometry of Curves and Surfaces with Mathematica
- Least squares conformal maps for automatic texture atlas generation