06013552

a

06013552 Aichholzer, Oswin Aigner, Wolfgang Aurenhammer, Franz \v{C}ech Dobi\'a\v{s}ov\'a, Kate\v{r}ina J\"uttler, Bert Rote, G\"unter Triangulations with circular ARCS. van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21--23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 296-307 (2012). 2012 Berlin: Springer EN

doi:10.1007/978-3-642-25878-7_29

Summary: 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.