Succinct Greedy Graph Drawing in the Hyperbolic Plane
| dc.creator | Eppstein, David | |
| dc.creator | Goodrich, Michael T. | |
| dc.date | 2008-06-02 | |
| dc.date.accessioned | 2026-07-07T09:42:15Z | |
| dc.date.available | 2026-07-07T09:42:15Z | |
| dc.description | We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so that a message M between any pair of vertices may be routed geometrically, simply by having each vertex that receives M pass it along to any neighbor that is closer in the hyperbolic metric to the message's eventual destination. More importantly, for networking applications, our algorithm produces succinct drawings, in that each of the vertex positions in one of our embeddings can be represented using O(log n) bits and the calculation of which neighbor to send a message to may be performed efficiently using these representations. These properties are useful, for example, for routing in sensor networks, where storage and bandwidth are limited. | |
| dc.description | 12 pages, 8 figures | |
| dc.identifier | https://arxiv.org/abs/0806.0341 | |
| dc.identifier | http://arxiv.org/abs/0806.0341 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/162114 | |
| dc.subject | Computational Geometry | |
| dc.subject | F.2.2; C.2.1 | |
| dc.title | Succinct Greedy Graph Drawing in the Hyperbolic Plane | |
| dc.type | text |