Limitations on Realistic Hyperbolic Graph Drawing
Computational Geometry
2021-08-18 v1
Abstract
We show that several types of graph drawing in the hyperbolic plane require features of the drawing to be separated from each other by sub-constant distances, distances so small that they can be accurately approximated by Euclidean distance. Therefore, for these types of drawing, hyperbolic geometry provides no benefit over Euclidean graph drawing.
Keywords
Cite
@article{arxiv.2108.07441,
title = {Limitations on Realistic Hyperbolic Graph Drawing},
author = {David Eppstein},
journal= {arXiv preprint arXiv:2108.07441},
year = {2021}
}
Comments
14 pages, 5 figures. Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)