Pointed drawings of planar graphs

DOI10.1016/J.COMGEO.2010.08.001zbMATH Open1319.65016DBLPjournals/comgeo/AichholzerRSV12OpenAlexW2129230319WikidataQ41643009 ScholiaQ41643009MaRDI QIDQ452448FDOQ452448

Authors: Günter Rote, André Schulz, Birgit Vogtenhuber, 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

Recommendations

• Drawing planar graphs on points inside a polygon
• scientific article; zbMATH DE number 1693555
• Drawing planar graphs
• Strictly convex drawings of planar graphs
• Strictly convex drawings of planar graphs
• Drawings of planar graphs with few slopes and segments
• Drawing planar graphs with few geometric primitives
• Drawing planar graphs with few geometric primitives
• Aligned drawings of planar graphs
• Aligned drawings of planar graphs

zbMATH Keywords

multigraphalgorithmvertex labelingangular resolutionparabolic arcsplanar drawingspointed pseudotriangulations[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=quadratic+B%EF%BF%BD%EF%BF%BDzier+curves&go=Go quadratic B��zier curves]tangent-continuous biarcs

Mathematics Subject Classification ID

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

Cites Work

• A variational principle for circle packings.
• On graphs and rigidity of plane skeletal structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• How to draw a planar graph on a grid
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pseudo-triangulations -- a survey
• Title not available (Why is that?)
• Planar minimally rigid graphs and pseudo-triangulations
• Acute triangulations of polygons
• THE VISIBILITY COMPLEX
• ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES
• A circle packing algorithm
• Pointed drawings of planar graphs
• A polynomial time circle packing algorithm

Cited In (4)

• Dépliage d'un graphe pointé en un cactus
• Non-convex Representations of Graphs
• Pointed drawings of planar graphs
• Triangulations with Circular Arcs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452448)