Limitations on realistic hyperbolic graph drawing
From MaRDI portal
Publication:2151459
DOI10.1007/978-3-030-92931-2_25OpenAlexW4205730198MaRDI QIDQ2151459
Publication date: 1 July 2022
Full work available at URL: https://arxiv.org/abs/2108.07441
angular resolutionhyperbolic graph drawingrealistic graph drawingvertex-edge resolutionvertex-vertex resolution
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metric embedding, hyperbolic space, and social networks
- A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
- Bold graph drawings
- Drawing graphs with right angle crossings
- How to draw a planar graph on a grid
- A simple approach for lower-bounding the distortion in any hyperbolic embedding
- Drawing trees with perfect angular resolution and polynomial area
- Every graph admits an unambiguous bold drawing
- Drawing Graphs in the Plane with High Resolution
- Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane
- On the Angular Resolution of Planar Graphs
- Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
- Drawing Planar Graphs with Large Vertices and Thick Edges
- Hyperbolic Embeddings for Near-Optimal Greedy Routing
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
- Drawing Planar Graphs on Area
- DRAWING WITH FAT EDGES
- Lombardi Drawings of Graphs
This page was built for publication: Limitations on realistic hyperbolic graph drawing
