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(logn) bits and distance comparisons may be performed efficiently using these representations. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Eppstein, D., & Goodrich, M. T. (2009). Succinct greedy graph drawing in the hyperbolic plane. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 14–25). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_3
Mendeley helps you to discover research relevant for your work.