Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Multiresolution signal processing for meshes
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Generic memoryless polygonal simplification
AFRIGRAPH '01 Proceedings of the 1st international conference on Computer graphics, virtual reality and visualisation
Evaluation of Memoryless Simplification
IEEE Transactions on Visualization and Computer Graphics
High-pass quantization for mesh encoding
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Mesh Simplification with Hierarchical Shape Analysis and Iterative Edge Contraction
IEEE Transactions on Visualization and Computer Graphics
Variational shape approximation
ACM SIGGRAPH 2004 Papers
LOD Modelling of polygonal models
Machine Graphics & Vision International Journal
Technical Section: Mesh simplification by stochastic sampling and topological clustering
Computers and Graphics
Deformable part inspection using a spring-mass system
Computer-Aided Design
| Hi-index | 0.00 |
Fast, reliable, and feature preserving automatic decimation of polygonal models is a challenging task. Exploiting both local volume and normal field variations in a novel way, a two phase decimation algorithm is proposed. In the first phase, a vertex is selected randomly using the measure of geometric fidelity that is based on normal field variation across its one-ring neighborhood. The selected vertex is eliminated in the second phase by collapsing an outgoing half-edge that is chosen by using volume based measure of geometric deviation. The proposed algorithm not only has better speed-quality trade-off but also keeps visually important features even after drastic simplification in a better way than similar state-of-the-art best algorithms; subjective and objective comparisons validate the assertion. This method can simplify huge models efficiently and is useful for applications where computing coordinates and/or attributes other than those attached to the original vertices is not allowed by the application and the focus is on both speed and quality of LODs.