2D triangulation representation using stable catalogs.∗

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006

Volumn , Issue , 2006, Pages 71-74

  Aleardi, Luca Castelli ^a   Devillers, Olivier ^a   Mebarki, Abdelkrim ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DIGITAL STORAGE;

CONNECTIVITY INFORMATION; CONSTANT TIME; EDGE FLIPS; GEOMETRY INFORMATION; MAIN MEMORY; MULTIPLE REFERENCES; SPACE EFFICIENT; VERTEX COORDINATES;

TRIANGULATION;

EID: 80051875924     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. P. K. Agarwal, J. Basch, L. J. Guibas, J. Hershberger, and L. Zhang. Deformable free space tilings for kinetic collision detection. In Proc. 5th Workshop Algorithmic Found. Robotics), pages 83–96. A. K. Peters, 2001.
2. P. Alliez and C. Gotsman. Advances in Multiresolution for Geometric Modelling. Recent Advances in Compression of 3D Meshes, 2005.
3. D. K. Blandford, G. E. Blelloch, D. E. Cardoze and C. Kadow. Compact Representations of Simplicial Meshes in Two and ThreeDimensions. In Proc. 12th International Meshing Roundtable, 2003.
4. J.-D. Boissonat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec. Triangulations in CGAL Comput. Geom. Theory & Applications 22(13):519, May 2002
5. P. Bose and G. Toussaint. Characterizing and efficiently computing quadrangulations of planar point sets. Comput. Aided Geom. Des., 14(8):763-785,1997.
6. L. Castelli Aleardi, O. Devillers and G. Schaeffer. Succinct representation of triangulations with a boundary. In Proc. of WADS 2005, p. 134-145, 2005.
7. L. Castelli Aleardi, O. Devillers and G. Schaeffer. Optimal succinct representations of planar maps. In Proc. SoCG, 2006, to appear.
8. A. Fabri, E. Fogel, B. Gärtner, M. Hoffmann, L. Kettner, S. Pion, M. Teillaud, R. Veltkamp and M. Yvinec. The CGAL Manual Release 3.0, 2003.
9. E. Heighway. A mesh generator for automatically subdividing irregular polygons into quadrilaterals. In IEEE Transactions on Magnetics,, 19(6):2535–2538, 1983.
10. M. Kallmann and D. Thalmann Star-vertices: a compact representation for planar meshes with adjacency information J. Graph. Tools, 6(1):7-18, 2001.
11. L. Kettner. Using generic programming for designing a data structure for polyhedral surfaces. Computational Geometry – Theory and Applications, 13:65–90, 1999.
12. J. Petersen. Die Theorie der regularen Graphs (The theory of regular graphs). Acta Mathematica, 15:193–220, 1891.
13. Dominique Poulalhon and Gilles Schaeffer. Optimal coding and sampling of triangulations. In Proc. of ICALP, p. 1080-1094, 2003.
14. S. Ramaswami, P.A. Ramos and G.T. Toussaint. Converting triangulations to quadrangulations. Comput. Geom. Theory & Applications 9(4):257-276, 1998.
15. G. Toussaint. Quadrangulations of Planar Sets. In Proc. of WADS, 218–227, 1995.