Limitations on Realistic Hyperbolic Graph Drawing

08/17/2021
by   David Eppstein, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2023

Recognizing Unit Disk Graphs in Hyperbolic Geometry is ∃ℝ-Complete

A graph G is a (Euclidean) unit disk graph if it is the intersection gra...
research
07/24/2021

RAC-drawability is ∃ℝ-complete

A RAC-drawing of a graph is a straight-line drawing in which every cross...
research
02/21/2020

Hyperbolic Minesweeper is in P

We show that, while Minesweeper is NP-complete, its hyperbolic variant i...
research
09/01/2022

Spherical Graph Drawing by Multi-dimensional Scaling

We describe an efficient and scalable spherical graph embedding method. ...
research
11/01/2021

Dynamic Distances in Hyperbolic Graphs

We consider the following dynamic problem: given a fixed (small) templat...
research
02/08/2018

Updating Dynamic Random Hyperbolic Graphs in Sublinear Time

Generative network models play an important role in algorithm developmen...
research
05/15/2022

The domino problem of the hyperbolic plane is undecidable, new proof

The present paper is a new version of the arXiv paper revisiting the pro...

Please sign up or login with your details

Forgot password? Click here to reset