Triangulations with circular arcs

Authors:
Oswin Aichholzer;Wolfgang Aigner;Franz Aurenhammer;Kate$#345/ina Č/ech Dobi$#225/$#353/ov$#225/;Bert Jü/ttler;Gü/nter Rote
Affiliations:
Institute for Software Technology, Graz University of Technology, Austria;Institute for Theoretical Computer Science, Graz University of Technology, Austria;Institute for Theoretical Computer Science, Graz University of Technology, Austria;Institute of Applied Geometry, Johannes Kepler University Linz, Austria;Institute of Applied Geometry, Johannes Kepler University Linz, Austria;Institut fü/r Informatik, Freie Universitä/t Berlin, Germany
Venue:
GD'11 Proceedings of the 19th international conference on Graph Drawing
Year:
2011

Citing 10
Cited 0

Testing the necklace condition for shortest tours and optimal factors in the plane

Theoretical Computer Science
On the angular resolution of planar graphs

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Drawing graphs in the plane with high resolution

SIAM Journal on Computing
Angles of Planar Triangular Graphs

SIAM Journal on Discrete Mathematics
Deciding Linear Inequalities by Computing Loop Residues

Journal of the ACM (JACM)
A framework for drawing planar graphs with curves and polylines

Journal of Algorithms
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
On triangulations of a set of points in the plane

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Lombardi drawings of graphs

GD'10 Proceedings of the 18th international conference on Graph drawing
Curvilinear graph drawing using the force-directed method

GD'04 Proceedings of the 12th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

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.