Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Model simplification using vertex-clustering
Proceedings of the 1997 symposium on Interactive 3D graphics
View-dependent simplification of arbitrary polygonal environments
Proceedings of the 24th 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
Progressive simplicial complexes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Smooth view-dependent level-of-detail control and its application to terrain rendering
Proceedings of the conference on Visualization '98
Fast and memory efficient polygonal simplification
Proceedings of the conference on Visualization '98
Out-of-core simplification of large polygonal models
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
A memory insensitive technique for large model simplification
Proceedings of the conference on Visualization '01
Efficient adaptive simplification of massive meshes
Proceedings of the conference on Visualization '01
Quadric-based polygonal surface simplification
Quadric-based polygonal surface simplification
Out-of-core construction and visualization of multiresolution surfaces
I3D '03 Proceedings of the 2003 symposium on Interactive 3D graphics
A Multiresolution Representation for Massive Meshes
IEEE Transactions on Visualization and Computer Graphics
Quadric-based simplification in any dimension
ACM Transactions on Graphics (TOG)
A Parallel Framework for Simplification of Massive Meshes
PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
Large Mesh Simplification using Processing Sequences
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Multi-resolution out-of-core modeling of terrain and teological data
Proceedings of the 13th annual ACM international workshop on Geographic information systems
A topology-preserving polygonal simplification using vertex clustering
GRAPHITE '05 Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes
AFRIGRAPH '06 Proceedings of the 4th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
IEEE Transactions on Visualization and Computer Graphics
Entity clustering using 3D mesh simplification
ICAI'08 Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information
3D mesh simplification techniques for image-page clusters detection
WSEAS Transactions on Information Science and Applications
The storage independent polygonal mesh simplification system
ICVR'07 Proceedings of the 2nd international conference on Virtual reality
View-dependent hierarchical foliage simplification
Edutainment'07 Proceedings of the 2nd international conference on Technologies for e-learning and digital entertainment
View-dependent hierarchical foliage simplification
Edutainment'07 Proceedings of the 2nd international conference on Technologies for e-learning and digital entertainment
Atlas-based organ & bone approximation for ex-vivo µMRI mouse data: a pilot study
ISBI'10 Proceedings of the 2010 IEEE international conference on Biomedical imaging: from nano to Macro
High-performance Monte Carlo radiosity on GPU based on scene partitioning
Microprocessors & Microsystems
Simplification and streaming of GIS terrain for web clients
Proceedings of the 17th International Conference on 3D Web Technology
| Hi-index | 0.00 |
We present a new multiphase method for efficiently simplifying polygonal surface models of arbitrary size. It operates by combining an initial out-of-core uniform clustering phase with a subsequent in-core iterative edge contraction phase. These two phases are both driven by quadric error metrics, and quadrics are used to pass information about the original surface between phases. The result is a method that produces approximations of a quality comparable to quadric-based iterative edge contraction, but at a fraction of the cost in terms of running time and memory consumption.