Triangulations with circular arcs

O. Aichholzer, W. Aigner, F. Aurenhammer, K. Cech Dobiašova, B. Jüttler, and G. Rote

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.

Reference: O. Aichholzer, W. Aigner, F. Aurenhammer, K. Cech Dobiašova, B. Jüttler, and G. Rote. Triangulations with circular arcs. In Proc. $19^{th}$ Int. Symposium on Graph Drawing, Springer LNCS, volume 7034, pages 296-307, Eindhoven, Netherlands, 2011.