Abstract
Triangulations in 2D and 3D are a necessary part of many applications. This paper brings a brief survey of main triangulations used in computer graphics and computational geometry, then focuses on Delaunay and greedy triangulations in 2D and 3D and presents their most important properties and algorithms. Then three applications from computer graphics and image processing areas are presented and results discussed. © Springer-Verlag 2004.
Cite
CITATION STYLE
Kolingerová, I. (2004). On Triangulations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3044, 544–553. https://doi.org/10.1007/978-3-540-24709-8_58
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
