Succinct Greedy Graph Drawing in the Hyperbolic Plane

DOI10.1007/978-3-642-00219-9_3zbMath1213.68444OpenAlexW1542976050MaRDI QIDQ3611834

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

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

Related Items (13)

On \(k\)-greedy routing algorithms ⋮ Succinct greedy drawings do not always exist ⋮ Some results on greedy embeddings in metric spaces ⋮ A generalized greedy routing algorithm for 2-connected graphs ⋮ 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 ⋮ Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints ⋮ Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane ⋮ An optimal greedy routing algorithm for triangulated polygons ⋮ Greedy Routing via Embedding Graphs onto Semi-metric Spaces ⋮ Every Schnyder drawing is a greedy embedding ⋮ Manhattan orbifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Some results on greedy embeddings in metric spaces
• How to draw a planar graph on a grid
• A data structure for dynamic trees
• On a conjecture related to geometric routing
• Geometric ad-hoc routing
• Distributed computation of virtual coordinates
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Finding cores of limited length
• Routing with guaranteed delivery in ad hoc wireless networks

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