Succinct Greedy Graph Drawing in the Hyperbolic Plane

DOI10.1007/978-3-642-00219-9_3MaRDI QIDQ3611834zbMATH OpenOpenAlexFDO

Authors David Eppstein, Michael T. Goodrich

Publication date 3 March 2009

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00219-9_3

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Succinct strictly convex greedy drawing of 3-connected plane graphs
• Succinct strictly convex greedy drawing of 3-connected plane graphs
• On succinct greedy drawings of plane triangulations and 3-connected plane graphs
• On succinct convex greedy drawing of 3-connected plane graphs
• Greedy drawings of triangulations
• scientific article; zbMATH DE number 1500678
• Drawing planar graphs with few geometric primitives
• Drawing planar graphs with few geometric primitives
• Curve-constrained drawings of planar graphs
• Strictly convex drawings of planar graphs

Cites work

• A data structure for dynamic trees
• Distributed computation of virtual coordinates
• Finding cores of limited length
• Geometric ad-hoc routing, of theory and practice
• How to draw a planar graph on a grid
• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 5764804 (Why is no real title available?)
• On a conjecture related to geometric routing
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Routing with guaranteed delivery in ad hoc wireless networks
• Some results on greedy embeddings in metric spaces

Cited in

(20)

• Manhattan orbifolds
• An optimal greedy routing algorithm for triangulated polygons
• Limitations on realistic hyperbolic graph drawing
• Every Schnyder drawing is a greedy embedding
• On k-greedy routing algorithms
• Succinct greedy drawings do not always exist
• Greedy Routing via Embedding Graphs onto Semi-metric Spaces
• Revisiting hyperbolic Voronoi diagrams in two and higher dimensions from theoretical, applied and generalized viewpoints
• Low distortion Delaunay embedding of trees in hyperbolic plane
• Category-based routing in social networks: membership dimension and the small-world phenomenon
• Greedy routing via embedding graphs onto semi-metric spaces
• A simple routing algorithm based on Schnyder coordinates
• scientific article; zbMATH DE number 2080110 (Why is no real title available?)
• scientific article; zbMATH DE number 1500678 (Why is no real title available?)
• On succinct greedy drawings of plane triangulations and 3-connected plane graphs
• scientific article; zbMATH DE number 7286697 (Why is no real title available?)
• Some results on greedy embeddings in metric spaces
• A generalized greedy routing algorithm for 2-connected graphs
• Using the metro-map metaphor for drawing hypergraphs
• Greedy drawings of triangulations

This page was built for publication: Succinct Greedy Graph Drawing in the Hyperbolic Plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611834)