Abstract
An important objective in the choice of a triangulation is that the smallest angle becomes as large as possible. In the straight-line case, it is known that the Delaunay triangulation is optimal in this respect. We propose and study the concept of a circular arc triangulation-a simple and effective alternative that offers flexibility for additionally enlarging small angles-and discuss its applications in graph drawing. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Aichholzer, O., Aigner, W., Aurenhammer, F., Čech Dobiášová, K., Jüttler, B., & Rote, G. (2012). Triangulations with circular arcs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7034 LNCS, pp. 296–307). https://doi.org/10.1007/978-3-642-25878-7_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
