Area requirement and symmetry display of planar upward drawings
Discrete & Computational Geometry
Transitions in geometric minimum spanning trees
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Proximity Drawability: a Survey
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Proximity drawings in polynomial area and volume
Computational Geometry: Theory and Applications
On a conjecture related to geometric routing
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Succinct Greedy Geometric Routing in the Euclidean Plane
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Greedy Drawings of Triangulations
Discrete & Computational Geometry
On convex greedy embedding conjecture for 3-connected planar graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Some Results on Greedy Embeddings in Metric Spaces
Discrete & Computational Geometry
Polynomial area bounds for MST embeddings of trees
Computational Geometry: Theory and Applications
On succinct convex greedy drawing of 3-connected plane graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
A greedy drawing is a graph drawing containing a distance-decreasing path for every pair of nodes. A path (v0,v1,…,vm) is distance-decreasing if d(vi,vm) d(vi-1,vm), for i = 1,…,m. Greedy drawings easily support geographic greedy routing. Hence, a natural and practical problem is the one of constructing greedy drawings in the plane using few bits for representing vertex Cartesian coordinates and using the Euclidean distance as a metric. We show that there exist greedy-drawable graphs that do not admit any greedy drawing in which the Cartesian coordinates have less than a polynomial number of bits. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012 (A preliminary version of this article appeared at the International Symposium on Graph Drawing (GD '09).)