Triangulations with circular arcs

O. Aichholzer, W. Aigner, F. Aurenhammer, K. Dobiásová, B. Jüttler, G. Rote

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
Pages (from-to)43-65
JournalJournal of Graph Algorithms and Applications
Issue number19
Publication statusPublished - 2015

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)


Dive into the research topics of 'Triangulations with circular arcs'. Together they form a unique fingerprint.

Cite this