Mesh reduction with error control
Proceedings of the 7th conference on Visualization '96
View-dependent refinement of progressive meshes
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
Designing a data structure for polyhedral surfaces
Proceedings of the fourteenth annual symposium on Computational geometry
Succinct Representation of Balanced Parentheses and Static Trees
SIAM Journal on Computing
XFastMesh: fast view-dependent meshing from external memory
Proceedings of the conference on Visualization '02
Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models
IEEE Transactions on Visualization and Computer Graphics
Truly selective refinement of progressive meshes
GRIN'01 No description on Graphics interface 2001
FastMesh: Efficient View-Dependent Meshing
PG '01 Proceedings of the 9th Pacific Conference on Computer Graphics and Applications
View-Dependent Streaming of Progressive Meshes
SMI '04 Proceedings of the Shape Modeling International 2004
Variational shape approximation
ACM SIGGRAPH 2004 Papers
Edge-Based Data Structures for Solid Modeling in Curved-Surface Environments
IEEE Computer Graphics and Applications
A polyhedron representation for computer vision
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
A QoS controller for adaptive streaming of 3D triangular scenes
Edutainment'07 Proceedings of the 2nd international conference on Technologies for e-learning and digital entertainment
Hi-index | 0.00 |
In this work a new multi-resolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The new hierarchical mesh representation combines a truly selective refinement scheme with a strict control of the two-sided Hausdorff distance. The proposed approach allows to build hierarchical meshes directly over non-triangulated polygonal models. As most dependencies in the hierarchy are in the form of trees, the resulting representation is very compact and allows for a compressed in-core representation. Furthermore an optimization scheme is proposed for the hierarchy based on variational shape approximation.