6 search results - page 1 / 2 » Online Routing in Convex Subdivisions |
ISAAC
2000
Springer
13 years 8 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
ISAAC
1999
Springer
13 years 9 months ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subd...
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...
SIAMCOMP
1998
13 years 4 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...