25 search results - page 5 / 5 » Area-preserving approximations of polygonal paths |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...
ICRA
2000
IEEE
13 years 11 months ago
2000
IEEE
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
VRST
1999
ACM
13 years 11 months ago
1999
ACM
This paper presents an image-based walkthrough technique where reference images are sparsely sampled along a path. The technique relies on a simple user interface for rapid modeli...
WADS
2001
Springer
13 years 11 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...