On succinct greedy drawings of plane triangulations and 3-connected plane graphs
DOI10.1007/S00453-012-9682-YzbMATH Open1318.68126OpenAlexW1979472618MaRDI QIDQ476437FDOQ476437
Authors: Huaming Zhang, Xin He 
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
Recommendations
- On succinct convex greedy drawing of 3-connected plane graphs
- Succinct strictly convex greedy drawing of 3-connected plane graphs
- Succinct strictly convex greedy drawing of 3-connected plane graphs
- On planar greedy drawings of 3-connected planar graphs
- On planar greedy drawings of 3-connected planar graphs
- On the area requirements of planar greedy drawings of triconnected planar graphs
- Greedy drawings of triangulations
- Strictly-convex drawings of 3-connected planar graphs
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
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)
Cites Work
- Planar graphs and poset dimension
- On a conjecture related to geometric routing
- Succinct greedy geometric routing in the Euclidean plane
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
- An Algorithm to Construct Greedy Drawings of Triangulations
- Some results on greedy embeddings in metric spaces
- Greedy drawings of triangulations
- Title not available (Why is that?)
- Output-sensitive reporting of disjoint paths
- Schnyder woods and orthogonal surfaces
- Geodesic embeddings and planar graphs
- Schnyder greedy routing algorithm
- Distributed computation of virtual coordinates for greedy routing in sensor networks
- Convex drawings of planar graphs and the order dimension of 3-polytopes
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- Convex drawings of 3-connected plane graphs
- Succinct greedy drawings do not always exist
- On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
Cited In (26)
- On planar greedy drawings of 3-connected planar graphs
- On planar greedy drawings of 3-connected planar graphs
- A generalized greedy routing algorithm for 2-connected graphs
- Succinct strictly convex greedy drawing of 3-connected plane graphs
- Succinct strictly convex greedy drawing of 3-connected plane graphs
- Succinct greedy drawings do not always exist
- Greedy rectilinear drawings
- Greedy rectilinear drawings
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
- On \(k\)-greedy routing algorithms
- On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
- Greedy routing via embedding graphs onto semi-metric spaces
- On succinct convex greedy drawing of 3-connected plane graphs
- Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
- Schnyder greedy routing algorithm
- An Algorithm to Construct Greedy Drawings of Triangulations
- Greedy drawings of triangulations
- On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
- Drawing graphs as spanners
- Succinct greedy geometric routing in the Euclidean plane
- Succinct greedy drawings do not always exist
- On self-approaching and increasing-chord drawings of 3-connected planar graphs
- Every Schnyder drawing is a greedy embedding
- Partitioning graph drawings and triangulated simple polygons into greedily routable regions
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- On the area requirements of planar greedy drawings of triconnected planar graphs
This page was built for publication: On succinct greedy drawings of plane triangulations and 3-connected plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476437)
