Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
An extension of manifold boundary representations to the r-sets
ACM Transactions on Graphics (TOG)
Real-time, continuous level of detail rendering of height fields
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
View-dependent refinement of progressive meshes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
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
Interactive multiresolution mesh editing
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
ROAMing terrain: real-time optimally adapting meshes
VIS '97 Proceedings of the 8th conference on Visualization '97
Simplicial maps for progressive transmission of polygonal surfaces
Proceedings of the third symposium on Virtual reality modeling language
Variable resolution triangulations
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Directed edges—A scalable representation for triangle meshes
Journal of Graphics Tools
A unified approach for hierarchical adaptive tesselation of surfaces
ACM Transactions on Graphics (TOG)
Efficient compression of non-manifold polygonal meshes
Computational Geometry: Theory and Applications - Special issue on multi-resolution modelling and 3D geometry compression
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
Proceedings of the sixth ACM symposium on Solid modeling and applications
Out-of-core build of a topological data structure from polygon soup
Proceedings of the sixth ACM symposium on Solid modeling and applications
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
Nonmanifold Topology Based on Coupling Entities
IEEE Computer Graphics and Applications
A Developer's Survey of Polygonal Simplification Algorithms
IEEE Computer Graphics and Applications
Non-manifold Decomposition in Arbitrary Dimensions
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Representation of non-manifold objects
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
A scalable data structure for three-dimensional non-manifold objects
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Decomposing non-manifold objects in arbitrary dimensions
Graphical Models - Special issue: Discrete topology and geometry for image and object representation
A framework for multi-dimensional adaptive subdivision objects
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
A ghost cell-based data structure for multiresolution meshes
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Interactive high quality trimmed NURBS visualization using appearance preserving tessellation
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
Hi-index | 0.01 |
We address the problem of representing and processing non-regular, non-manifold two-dimensional simplicial meshes, that we call triangle-segment meshes, at different levels of detail. Such meshes are used to describe spatial objects consisting of parts of mixed dimensions, and with a non-manifold topology. First, we describe a multi-resolution model for non-regular, non-manifold meshes, that we call a Non-manifold Multi-Tessellation (NMT). We consider the selective refinement query, which is at the heart of several analysis operations on multiresolution meshes. Next, we focus on a specific instance of a NMT, generated by a simplification process based on vertex-pair contraction, and we describe a compact data structure for encoding it. We also propose a new data structure for triangle-segment meshes, capable of representing both connectivity and adjacency information with a small memory overhead, that we use to describe the mesh extracted with selective refinement. To this aim, we define algorithms to efficiently perform mesh updates on such a data structure.