Recommended Reading
Blanford D, Blelloch G, Kash I (2003) Compact representations of separable graphs. In: SODA, Baltimore, pp 342–351. http://dl.acm.org/citation.cfm?id=644219
Boissonnat JD, Devillers O, Pion S, Teillaud M, Yvinec M (2002) Triangulations in CGAL. Comput Geom 22:5–19. doi:http://dx.doi.org/10.1145/336154.336165
Castelli Aleardi L, Devillers O (2011) Explicit array-based compact data structures for triangulations. In: ISAAC, Yokohama, pp 312–322. doi:http://dx.doi.org/10.1007/978-3-642-25591-5_33
Castelli Aleardi L, Devillers O, Schaeffer G (2005) Succinct representation of triangulations with a boundary. In: WADS, Waterloo, pp 134–145. doi:http://dx.doi.org/10.1007/11534273_13
Castelli Aleardi L, Devillers O, Schaeffer G (2008) Succinct representations of planar maps. Theor Comput Sci 408(2–3):174–187. doi:http://dx.doi.org/10.1016/j.tcs.2008.08.016
Castelli Aleardi L, Devillers O, Mebarki A (2011) Catalog based representation of 2D triangulations. Int J Comput Geom Appl 21(4):393–402. doi:http://dx.doi.org/10.1142/S021819591100372X
Castelli Aleardi L, Devillers O, Rossignac J (2012) ESQ: editable squad representation for triangle meshes. In: SIBGRAPI, Ouro Preto, pp 110–117. doi:http://dx.doi.org/10.1109/SIBGRAPI.2012.24
Gurung T, Rossignac J (2009) SOT: compact representation for tetrahedral meshes. In: Proceedings of the ACM symposium on solid and physical modeling, San Francisco, pp 79–88. doi:http://dx.doi.org/10.1145/1629255.1629266
Gurung T, Laney D, Lindstrom P, Rossignac J (2011) SQUAD: compact representation for triangle meshes. Comput Graph Forum 30(2):355–364. doi:http://dx.doi.org/10.1111/j.1467-8659.2011.01866.x
Gurung T, Luffel M, Lindstrom P, Rossignac J (2011) LR: compact connectivity representation for triangle meshes. ACM Trans Graph 30(4):67. doi:http://dx.doi.org/10.1145/2010324.1964962
Gurung T, Luffel M, Lindstrom P, Rossignac J (2013) Zipper: a compact connectivity data structure for triangle meshes. Comput-Aided Des 45(2):262–269. doi:http://dx.doi.org/10.1016/j.cad.2012.10.009
Luffel M, Gurung T, Lindstrom P, Rossignac J (2014) Grouper: a compact, streamable triangle mesh data structure. IEEE Trans Vis Comput Graph 20(1):84–98. doi:http://dx.doi.org/10.1109/TVCG.2013.81
Poulalhon D, Schaeffer G (2006) Optimal coding and sampling of triangulations. Algorithmica 46:505–527. doi:http://dx.doi.org/10.1007/s00453-006-0114-8
Schnyder W (1990) Embedding planar graphs on the grid. In: SODA, San Francisco, 138–148. http://dl.acm.org/citation.cfm?id=320191
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this entry
Cite this entry
Aleardi, L., Devillers, O., Rossignac, J. (2015). Triangulation Data Structures. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27848-8_589-1
Download citation
DOI: https://doi.org/10.1007/978-3-642-27848-8_589-1
Received:
Accepted:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Online ISBN: 978-3-642-27848-8
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering