44 search results - page 2 / 9 » Greedy drawings of triangulations |
JCO
1998
13 years 4 months ago
1998
GD
2008
Springer
13 years 5 months ago
2008
Springer
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...
GD
2005
Springer
13 years 10 months ago
2005
Springer
COMPGEOM
1995
ACM
13 years 8 months ago
1995
ACM
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
SIROCCO
2001
13 years 6 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...