Optimal succinct representations of planar maps

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 309-318

  Castelli Aleardi, Luca ^a   Devillers, Olivier ^b   Schaeffer, Gilles ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

^b INRIA   (France)

Author keywords

Geometric data structures; Graph encoding; Mesh compression; Planar maps; Succinct data structures

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA COMPRESSION; INFORMATION ANALYSIS; PROBLEM SOLVING; TOPOLOGY; TRIANGULATION;

GEOMETRIC DATA STRUCTURES; GRAPH ENCODING; MESH COMPRESSION; PLANAR MAPS; SUCCINCT DATA STRUCTURES;

GRAPH THEORY;

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

References (23)

1. L. Castelli Aleardi, O. Devillers, and G. Schaeffer. Succinct representation of triangulations with a boundary. In Proc. of WADS, 134-145, 2005.
2. L. Castelli Aleardi, O. Devillers, and G. Schaeffer. Dynamic update of succinct triangulations. In Proc. of CCCG, pages 135-138, 2005.
3. P. Alliez and C. Gotsman. Recent advances in compression of 3d meshes, In N.A. Dodgson, M.S. Floater, and M.A. Sabin, editors, Advances in Multiresolution for Geometric Modelling, pages 3-26. Springer-Verlag, 2005.
4. D. Blanford, G. Blelloch, and I. Kash. Compact representations of separable graphs. In Proc. SODA, 342-351, 2003.
5. J.-D. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec. Triangulations in CGAL. Comp. Geom.: Theory and Appl., 22:5-19, 2002.
6. Y.-T. Chiang, C.-C. Lin, and H.-I. Lu. Orderly spanning trees with applications to graph encoding and graph drawing. Proc. of SODA, pages 506-515, 2001.
7. R.C.-N Chuang, A. Garg, X. He, M.-Y. Kao, and H.-I. Lu. Compact encodings of planar graphs via canonical orderings and multiple parentheses. Proc. of ICALP, pages 118-129, 1998.
8. E. Fusy, D. Poulalhon and G. Schaeffer. Dissections and trees, with applications to optimal mesh encoding and to random sampling In Proc. of SODA, 690-699, 2005.
9. R. Geary, R. Raman and V. Raman. Succint ordinal trees with level-ancestor queries. In Proc. of SODA, 1-10, 2004.
10. M. Isenburg and J. Snoeyink. Graph Coding and Connectivity Compression, manuscript, 2004.
11. G. Jacobson. Space efficients static trees and graphs. In Proc. of FOCS, 549-554, 1989.
12. K. Keeler and J.Westbrook. Short encodings of planar graphs and maps. Discr. Appl. Math., 239-252, 1995.
13. A. Khodakovsky and P. Alliez and M. Desbrun and P. Schroder. Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes. In J. of the Graph. Models, pages, 2002.
14. M. Kallmann and D. Thalmann. Star-vertices; a compact representation for planar meshes with adjacency information. J. of Graphics Tools, 6:7-18, 2002.
15. J. I. Munro and V. Raman. Succint representation of balanced parantheses and static trees. SIAM J. on Computing 31:762-776, 2001.
16. (also in FOCS '97).
17. J. I. Munro, V. Raman, and A. J. Storm. Representing dynamic binary trees succintly. Proc. of SODA,529-536, 2001.
18. D. Poulalhon and G. Schaeffer. Optimal coding and sampling of triangulations. In Proc. of ICALP, 1080-1094, 2003.
19. J. Rossignac. Edgebreaker: Connectivity compression for triangle meshes. In IEEE Trans. Visual, and Comp. Graph., 5:47-61, 1999.
20. C. Touma and C. Gotsman Triangle mesh compression. In Graphics Interface, pages 26-34, 1998.
21. G. Turan. Succinct representations of graphs. In Discr. and Appl. Math, pages 289-294, 1984.
22. W. Tutte. A census of planar triangulations. Canadian J. of Mathematics, 14:21-38, 1962.
23. W. Tutte. A census of planar maps. Canadian J. of Mathematics, 15:249-271, 1963.