Greedy drawings of triangulations
From MaRDI portal
Publication:848683
DOI10.1007/s00454-009-9235-6zbMath1213.05180OpenAlexW2014505326MaRDI QIDQ848683
Publication date: 4 March 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9235-6
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (17)
On \(k\)-greedy routing algorithms ⋮ Succinct greedy drawings do not always exist ⋮ Local routing in sparse and lightweight geometric graphs ⋮ Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles ⋮ Euclidean greedy drawings of trees ⋮ A simple routing algorithm based on Schnyder coordinates ⋮ Acyclic colorings of graph subdivisions revisited ⋮ Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators ⋮ On succinct greedy drawings of plane triangulations and 3-connected plane graphs ⋮ Morphing Schnyder drawings of planar triangulations ⋮ Monotone drawings of graphs with few directions ⋮ 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 ⋮ Every Schnyder drawing is a greedy embedding ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex drawings of 3-connected plane graphs
- Rubber bands, convex embeddings and graph connectivity
- On a conjecture related to geometric routing
- Geometric ad-hoc routing
- A Theorem on Planar Graphs
- Convex Representations of Graphs
- Efficient Planarity Testing
- Convex drawings of planar graphs and the order dimension of 3-polytopes
This page was built for publication: Greedy drawings of triangulations
