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