On succinct greedy drawings of plane triangulations and 3-connected plane graphs
From MaRDI portal
Publication:476437
DOI10.1007/s00453-012-9682-yzbMath1318.68126OpenAlexW1979472618MaRDI QIDQ476437
Publication date: 2 December 2014
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9682-y
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles ⋮ On the area requirements of planar greedy drawings of triconnected planar graphs ⋮ Greedy rectilinear drawings ⋮ On planar greedy drawings of 3-connected planar graphs ⋮ Greedy rectilinear drawings ⋮ Drawing graphs as spanners
Cites Work
- Unnamed Item
- Distributed computation of virtual coordinates for greedy routing in sensor networks
- Some results on greedy embeddings in metric spaces
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- Greedy drawings of triangulations
- Convex drawings of 3-connected plane graphs
- Schnyder woods and orthogonal surfaces
- Planar graphs and poset dimension
- Output-sensitive reporting of disjoint paths
- Geodesic embeddings and planar graphs
- On a conjecture related to geometric routing
- Succinct greedy drawings do not always exist
- On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
- Schnyder Greedy Routing Algorithm
- Succinct Greedy Geometric Routing in the Euclidean Plane
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
- An Algorithm to Construct Greedy Drawings of Triangulations
- Convex drawings of planar graphs and the order dimension of 3-polytopes
This page was built for publication: On succinct greedy drawings of plane triangulations and 3-connected plane graphs
