Succinct representation of triangulations with a boundary

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 134-145

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

^a ECOLE POLYTECHNIQUE   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY; NAVIGATION; PROBLEM SOLVING; TRIANGULATION;

ADJACENT TRIANGULATION; GEOMETRIC DATA STRUCTURES; SUCCINT REPRESENTATION;

DATA STRUCTURES;

EID: 26844436915     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_13     Document Type: Conference Paper

References (14)

1. L. Castelli Aleardi, O. Devillers, and G. Schaeffer. Compact representation of triangulations. Technical report, RR-5433 INRIA, 2004. available at http://www.inria.fr/rrrt/rr-5433.html.
2. 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.
3. D. Blanford, G. Blelloch, and I. Kash. Compact representations of separable graphs. In Proc. of the Annual ACM-SIAM Symp. on Discrete Algorithms, pages 342-351, 2003.
4. J.-D. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec. Triangulations in CGAL. Comput. Geom. Theory Appl., 22:5-19, 2002.
5. Y.-T. Chiang, C.-C. Lin, and H.-I. Lu. Orderly spanning trees with applications to graph encoding and graph drawing. SODA, pages 506-515, 2001.
6. 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. Automata, Laguages and Programming, pages 118-129, 1998.
7. D. R. Clark and J. I. Munro. Efficient suffix trees on secondary storage. In SODA, pages 383-391, 1996.
8. G. Jacobson. Space efficients static trees and graphs. In Proceedings of the IEEE Symposium on Foundations of Computerb Science (FOCS), pages 549-554, 1989.
9. M. Kallmann and D. Thalmann. Star-vertices: a compact representation for planar meshes with adjacency information. Journal of Graphics Tools, 6:7-18, 2002.
10. J. I. Munro and V. Raman. Succint representation of balanced parantheses and static trees. SIAM J. on Computing, 31:762-776, 2001.
11. J. I. Munro, V. Raman, and A. J. Storm. Representing dynamic binary trees succintly. In SODA, pages 529-536, 2001.
12. D. Poulalhon and G. Schaeffer. Optimal coding and sampling of triangulations. In Proc. Intern. Colloqium ICALP'03, pages 1080-1094, 2003.
13. R. Raman, V. Raman, and S.S. Rao. Succint indexable dictionaries with application to encoding k-ary trees and multisets. In SODA, pages 233-242, 2002.
14. V. Raman and S.S. Rao. Static dictionaries supporting rank. In ISAAC, pages 18-26, 1999.