On succinct greedy drawings of plane triangulations and 3-connected plane graphs
From MaRDI portal
(Redirected from Publication:476437)
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
Cites work
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- An Algorithm to Construct Greedy Drawings of Triangulations
- Convex drawings of 3-connected plane graphs
- Convex drawings of planar graphs and the order dimension of 3-polytopes
- Distributed computation of virtual coordinates for greedy routing in sensor networks
- Geodesic embeddings and planar graphs
- Greedy drawings of triangulations
- On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
- On a conjecture related to geometric routing
- Output-sensitive reporting of disjoint paths
- Planar graphs and poset dimension
- Schnyder greedy routing algorithm
- Schnyder woods and orthogonal surfaces
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- Some results on greedy embeddings in metric spaces
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
- Succinct greedy drawings do not always exist
- Succinct greedy geometric routing in the Euclidean plane
Cited in
(26)- Greedy routing via embedding graphs onto semi-metric spaces
- Greedy rectilinear drawings
- Greedy rectilinear drawings
- Succinct greedy drawings do not always exist
- Schnyder greedy routing algorithm
- On the area requirements of planar greedy drawings of triconnected planar graphs
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
- On self-approaching and increasing-chord drawings of 3-connected planar graphs
- On \(k\)-greedy routing algorithms
- Greedy drawings of triangulations
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- Partitioning graph drawings and triangulated simple polygons into greedily routable regions
- On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
- On planar greedy drawings of 3-connected planar graphs
- On succinct convex greedy drawing of 3-connected plane graphs
- A generalized greedy routing algorithm for 2-connected graphs
- On planar greedy drawings of 3-connected planar graphs
- An Algorithm to Construct Greedy Drawings of Triangulations
- Succinct greedy geometric routing in the Euclidean plane
- On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
- Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
- Drawing graphs as spanners
- Succinct greedy drawings do not always exist
- Succinct strictly convex greedy drawing of 3-connected plane graphs
- Every Schnyder drawing is a greedy embedding
- Succinct strictly convex greedy drawing of 3-connected plane 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)
