Sciweavers

24 search results - page 5 / 5
» Distance-Preserving Approximations of Polygonal Paths
Sort
View
ISAAC
2007
Springer
122views Algorithms» more  ISAAC 2007»
13 years 11 months ago
Compressing Spatio-temporal Trajectories
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...
Joachim Gudmundsson, Jyrki Katajainen, Damian Merr...
ICRA
2000
IEEE
180views Robotics» more  ICRA 2000»
13 years 9 months ago
Interactive Motion Planning Using Hardware-Accelerated Computation of Generalized Voronoi Diagrams
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
VRST
1999
ACM
13 years 9 months ago
Navigating through sparse views
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...
Shachar Fleishman, Baoquan Chen, Arie E. Kaufman, ...
WADS
2001
Springer
113views Algorithms» more  WADS 2001»
13 years 9 months ago
Movement Planning in the Presence of Flows
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...
John H. Reif, Zheng Sun