Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Grouping nearly coplanar polygons into coplanar sets
Graphics Gems III
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Octree pruning for variable-resolution isosurfaces
CG International '92 Proceedings of the 10th International Conference of the Computer Graphics Society on Visual computing : integrating computer graphics with computer vision: integrating computer graphics with computer vision
Hierarchical geometric models for visible surface algorithms
Communications of the ACM
Massively parallel isosurface extraction
VIS '92 Proceedings of the 3rd conference on Visualization '92
Fast data parallel polygon rendering
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Dynamic view-dependent simplification for polygonal models
Proceedings of the 7th conference on Visualization '96
A topology modifying progressive decimation algorithm
VIS '97 Proceedings of the 8th conference on Visualization '97
Levels of detail & polygonal simplification
Crossroads - Special issue on computer graphics
A general method for preserving attribute values on simplified meshes
Proceedings of the conference on Visualization '98
Using naming time to evaluate quality predictors for model simplification
Proceedings of the SIGCHI conference on Human Factors in Computing Systems
Measuring and predicting visual fidelity
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Texture mapping progressive meshes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Controlled Topology Simplification
IEEE Transactions on Visualization and Computer Graphics
Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models
IEEE Transactions on Visualization and Computer Graphics
Locally Toleranced Surface Simplification
IEEE Transactions on Visualization and Computer Graphics
Superfaces: Polygonal Mesh Simplification with Bounded Error
IEEE Computer Graphics and Applications
Mesh Approximation Using a Volume-Based Metric
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
SwingWrapper: Retiling triangle meshes for better edgebreaker compression
ACM Transactions on Graphics (TOG)
Mesh Simplification with Hierarchical Shape Analysis and Iterative Edge Contraction
IEEE Transactions on Visualization and Computer Graphics
A Parallel Framework for Simplification of Massive Meshes
PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
Multi-edge decimation in multi-modal 3D collaborative applications
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Remote large data visualization in the paraview framework
EG PGV'06 Proceedings of the 6th Eurographics conference on Parallel Graphics and Visualization
Evolutionary multi-objective optimization for mesh simplification of 3D open models
Integrated Computer-Aided Engineering
| Hi-index | 0.00 |
An algorithm is presented which describes an application independent method for reducing the number of polygonal primitives required to faithfully represent an object. Reducing polygon count without a corresponding reduction in object detail is important for: achieving interactive frame rates in scientific visualization, reducing mass storage requirements, and facilitating the transmission of large, multi-timestep geometric data sets. This paper shows how coplanar and nearly coplanar polygons can be merged into larger complex polygons and re-triangulated into fewer simple polygons than originally required. The notable contributions of this paper are: 1) a method for quickly grouping polygons into nearly coplanar sets, 2) a fast approach for merging coplanar polygon sets and, 3) a simple, robust triangulation method for polygons created by 1 and 2. The central idea of the algorithm is the notion of treating polygonal data as a collection of segments and removing redundant segments to quickly from polygon hulls which represent the merged coplanar sets.