Succinct Greedy Graph Drawing in the Hyperbolic Plane

Eppstein, David and Goodrich, Michael T. (2009) Succinct Greedy Graph Drawing in the Hyperbolic Plane. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 14-25(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_3).

Full text not available from this repository.

Abstract

We describe a method for producing a greedy embedding of any n- vertex simple graph G in the hyperbolic plane, so that a message M between any pair of vertices may be routed by having each vertex that receives M pass it to a neighbor that is closer to M ’s destination. Our algorithm produces succinct drawings, where vertex positions are represented using O(log n) bits and distance comparisons may be performed efficiently using these representations.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-00219-9_3
Classifications: P Styles > P.420 Hyper
URI: http://gdea.informatik.uni-koeln.de/id/eprint/893

Actions (login required)

View Item View Item