Pointed drawings of planar graphs

DOI10.1016/j.comgeo.2010.08.001zbMath1319.65016OpenAlexW2129230319WikidataQ41643009 ScholiaQ41643009MaRDI QIDQ452448

Birgit Vogtenhuber, André Schulz, Günter Rote, Oswin Aichholzer

Publication date: 21 September 2012

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.08.001

zbMATH Keywords

multigraphalgorithmangular resolutionvertex labelingparabolic arcsplanar drawingspointed pseudotriangulationsquadratic Bézier curvestangent-continuous biarcs

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items

Pointed drawings of planar graphs ⋮ Non-convex Representations of Graphs ⋮ Triangulations with Circular Arcs

Cites Work

• Pointed drawings of planar graphs
• A polynomial time circle packing algorithm
• How to draw a planar graph on a grid
• A variational principle for circle packings.
• Planar minimally rigid graphs and pseudo-triangulations
• A circle packing algorithm
• On graphs and rigidity of plane skeletal structures
• ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES
• THE VISIBILITY COMPLEX
• Acute triangulations of polygons
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pointed drawings of planar graphs