SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Fast and memory efficient polygonal simplification
Proceedings of the conference on Visualization '98
Mesh Approximation Using a Volume-Based Metric
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
A Survey of Polygonal Simplification Algorithms
A Survey of Polygonal Simplification Algorithms
LOD Modelling of polygonal models
Machine Graphics & Vision International Journal
Technical Section: Moment-based metrics for mesh simplification
Computers and Graphics
| Hi-index | 0.00 |
A fast greedy algorithm for automatic decimation of polygonal meshes is proposed. Two important components of an automatic decimation algorithm are: the measure of fidelity and the iterative framework for incrementally and locally simplifying a polyhedra. The proposed algorithm employs vertex-based greedy framework for incrementally simplifying a polygonal model. Exploiting the normal field of one-ring neighborhood of a vertex, a new measure of fidelity is proposed that reflects the impotence of the vertices and is used to guide the vertex-based greedy procedure. A vertex causing minimum distortion is selected for removal and it is eliminated by collapsing one of its half-edges that causes minimum geometric distortion in the mesh. The proposed algorithm is about two times faster than QSlim algorithm, which is considered to be the fastest state-of-the-art greedy algorithm that produces reliable approximations; it competes well with QSlim in terms of Hausdorff distance, and preserves visually important features in a better way.