Introduction to Solid Modeling
Introduction to Solid Modeling
Representing geometric structures in d dimensions: topology and order
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Subdivisions of n-dimensional spaces and n-dimensional generalized maps
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Designing a data structure for polyhedral surfaces
Proceedings of the fourteenth annual symposium on Computational geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Directed edges—A scalable representation for triangle meshes
Journal of Graphics Tools
Winged edge polyhedron representation.
Winged edge polyhedron representation.
Optimal succinct representations of planar maps
Proceedings of the twenty-second annual symposium on Computational geometry
Succinct representations of planar maps
Theoretical Computer Science
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
Proceedings of the twenty-fifth annual symposium on Computational geometry
SOT: compact representation for tetrahedral meshes
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
AIF: a data structure for polygonal meshes
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
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
Navigation queries from triangular meshes
MIG'10 Proceedings of the Third international conference on Motion in games
LR: compact connectivity representation for triangle meshes
ACM SIGGRAPH 2011 papers
Succinct representation of triangulations with a boundary
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Explicit array-based compact data structures for triangulations
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Zipper: A compact connectivity data structure for triangle meshes
Computer-Aided Design
| Hi-index | 0.00 |
In this paper we propose a new structure star-vertex, to represent general planar meshes. The basic concept is simple, allowing constant adjacency query time, and scalability (able to trade size for speed), and under specific situations requiring less storage space than others. For simplicity, we use a generic traverse element, which resembles the behavior of oriented edges. We present implementation examples of the proposed structure and comparisons with other mesh representation schemes.