The design and analysis of spatial data structures
The design and analysis of spatial data structures
Approximating polyhedra with spheres for time-critical collision detection
ACM Transactions on Graphics (TOG)
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
OBBTree: a hierarchical structure for rapid interference detection
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
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
Surface approximation and geometric partitions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Out-of-core simplification of large polygonal models
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
QSplat: a multiresolution point rendering system for large meshes
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Hierarchical face clustering on polygonal surfaces
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
A memory insensitive technique for large model simplification
Proceedings of the conference on Visualization '01
Quadric-based polygonal surface simplification
Quadric-based polygonal surface simplification
A memory insensitive technique for large model simplification
Proceedings of the conference on Visualization '01
Out-of-core rendering of massive geometric environments
Proceedings of the conference on Visualization '02
A multiphase approach to efficient surface simplification
Proceedings of the conference on Visualization '02
Efficient simplification of point-sampled surfaces
Proceedings of the conference on Visualization '02
XFastMesh: fast view-dependent meshing from external memory
Proceedings of the conference on Visualization '02
Out-of-core construction and visualization of multiresolution surfaces
I3D '03 Proceedings of the 2003 symposium on Interactive 3D graphics
Multiresolution volume simplification and polygonization
VG '03 Proceedings of the 2003 Eurographics/IEEE TVCG Workshop on Volume graphics
External Memory Management and Simplification of Huge Meshes
IEEE Transactions on Visualization and Computer Graphics
Quick-VDR: Interactive View-Dependent Rendering of Massive Models
VIS '04 Proceedings of the conference on Visualization '04
Dual Contouring with Topology-Preserving Simplification Using Enhanced Cell Representation
VIS '04 Proceedings of the conference on Visualization '04
A Multiresolution Representation for Massive Meshes
IEEE Transactions on Visualization and Computer Graphics
Quadric-based simplification in any dimension
ACM Transactions on Graphics (TOG)
Quick-VDR: Out-of-Core View-Dependent Rendering of Gigantic Models
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
Hierarchical Clustering for Unstructured Volumetric Scalar Fields
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
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
Geometric modeling based on triangle meshes
ACM SIGGRAPH 2006 Courses
Out-of-Core Remeshing of Large Polygonal Meshes
IEEE Transactions on Visualization and Computer Graphics
Real-time mesh simplification using the GPU
Proceedings of the 2007 symposium on Interactive 3D graphics and games
Detail calibration for out-of-core model simplification through interlaced sampling
ACM SIGGRAPH 2002 conference abstracts and applications
IEEE Transactions on Visualization and Computer Graphics
Massive model visualization techniques: course notes
ACM SIGGRAPH 2008 classes
Effective Spatial Characterization System Using Density-Based Clustering
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
Technical Section: Mesh simplification by stochastic sampling and topological clustering
Computers and Graphics
Technical Section: Fiedler trees for multiscale surface analysis
Computers and Graphics
ASM: An adaptive simplification method for 3D point-based models
Computer-Aided Design
Bilateral estimation of vertex normal for point-sampled models
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Real-time appearance preserving out-of-core rendering with shadows
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
| Hi-index | 0.00 |
The growing availability of massive polygonal models, and the inability of most existing visualization tools to work with such data, has created a pressing need for memory efficient methods capable of simplifying very large meshes. In this paper, we present a method for performing adaptive simplification of polygonal meshes that are too large to fit in-core.Our algorithm performs two passes over an input mesh. In the first pass, the model is quantized using a uniform grid, and surface information is accumulated in the form of quadrics and dual quadrics. This sampling is then used to construct a BSP-Tree in which the partitioning planes are determined by the dual quadrics. In the final pass, the original vertices are clustered using the BSP-Tree, yielding an adaptive approximation of the original mesh. The BSP-Tree describes a natural simplification hierarchy, making it possible to generate a progressive transmission and construct level-of-detail representations. In this way, the algorithm provides some of the features associated with more expensive edge contraction methods while maintaining greater computational efficiency. In addition to performing adaptive simplification, our algorithm exhibits output-sensitive memory requirements and allows fine control over the size of the simplified mesh.