79 search results - page 4 / 16 » Shortest path in a polygon using sublinear space |
138
click to vote
TIP
1998
15 years 3 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
150
Voted
ESA
2005
Springer
15 years 9 months ago
2005
Springer
We present a new speedup technique for route planning that exploits the hierarchy inherent in real world road networks. Our algorithm preprocesses the eight digit number of nodes n...
134
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
145
click to vote
SSD
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
143
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...