Triangulations with Circular Arcs

DOI10.1007/978-3-642-25878-7_29zbMath1311.68162OpenAlexW2138800767MaRDI QIDQ5895516

Bert Jüttler, Kateřina Čech Dobiášová, Franz Aurenhammer, Oswin Aichholzer, Wolfgang Aigner, Günter Rote

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_29

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Uses Software

• Voronoi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pointed drawings of planar graphs
• Constrained Delaunay triangulations
• Lexicographic bottleneck problems
• Lexicographic optimality in the multiple objective linear programming: The nucleolar solution
• A characterization of the minimum cycle mean in a digraph
• Testing the necklace condition for shortest tours and optimal factors in the plane
• COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION
• Drawing Graphs in the Plane with High Resolution
• Deciding Linear Inequalities by Computing Loop Residues
• On the Angular Resolution of Planar Graphs
• A Framework for Drawing Planar Graphs with Curves and Polylines
• Graph Drawing and Applications for Software and Knowledge Engineers
• Guaranteed-quality triangular mesh generation for domains with curved boundaries
• Angles of Planar Triangular Graphs
• Fixed-Location Circular Arc Drawing of Planar Graphs
• Lombardi Drawings of Graphs

This page was built for publication: Triangulations with Circular Arcs