Self-approaching Graphs
From MaRDI portal
Publication:4912208
DOI10.1007/978-3-642-36763-2_23zbMath1377.68158arXiv1306.5460OpenAlexW1624197878MaRDI QIDQ4912208
Anna Lubiw, Vinayak Pathak, Timothy M. Chan, Elyot Grant, Soroush Alamdari
Publication date: 3 April 2013
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5460
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
On the plane angle-monotone graphs ⋮ Angle-monotonicity of Delaunay triangulation ⋮ 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 ⋮ Continuous Yao graphs ⋮ Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition ⋮ Construction and Local Routing for Angle-Monotone Graphs ⋮ Monotone drawings of graphs with few directions ⋮ 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
