Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane

DOI10.1007/978-3-642-25878-7_34zbMath1311.68177OpenAlexW2199357291MaRDI QIDQ3223968

Rik Sarkar

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_34

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 representations (geometric and intersection representations, etc.) (05C62)

Related Items (8)

Global Graph Curvature ⋮ Limitations on realistic hyperbolic graph drawing ⋮ Metric embedding, hyperbolic space, and social networks ⋮ Phylogenetic placement problem: a hyperbolic embedding approach ⋮ Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane ⋮ On the \(f\)-divergences between hyperboloid and Poincaré distributions ⋮ Umbel convexity and the geometry of trees ⋮ Hyperbolic Embeddings for Near-Optimal Greedy Routing

Cites Work

• Unnamed Item
• Additive spanners and distance and routing labeling schemes for hyperbolic graphs
• Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints
• Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane
• Lower-stretch spanning trees
• Improved embeddings of graph metrics into random trees
• Succinct Greedy Graph Drawing in the Hyperbolic Plane
• A tight bound on approximating arbitrary metrics by tree metrics
• Trees and Markov convexity

This page was built for publication: Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane