On self-approaching and increasing-chord drawings of 3-connected planar graphs
From MaRDI portal
Publication:2970443
DOI10.20382/jocg.v7i1a3zbMath1405.68253arXiv1409.0315MaRDI QIDQ2970443
Ignaz Rutter, Roman Prutkin, Martin Nöllenburg
Publication date: 30 March 2017
Full work available at URL: https://arxiv.org/abs/1409.0315
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Unnamed Item, On the Stretch Factor of Polygonal Chains, Rooted Uniform Monotone Minimum Spanning Trees, Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions, Optimal Monotone Drawings of Trees, Construction and Local Routing for Angle-Monotone Graphs, Greedy rectilinear drawings, Greedy rectilinear drawings, Drawing graphs as spanners, Morphing triangle contact representations of triangulations, (Weakly) self-approaching geometric graphs and spanners, On the area requirements of planar greedy drawings of triconnected planar graphs, Self-approaching paths in simple polygons, On planar greedy drawings of 3-connected planar graphs, Euclidean greedy drawings of trees