Triangulations with Circular Arcs

摘要

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.