24 search results - page 4 / 5 » Distance-Preserving Approximations of Polygonal Paths |
ICRA
2009
IEEE
14 years 12 days ago
2009
IEEE
— In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths f...
CGF
2011
12 years 9 months ago
2011
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
SIROCCO
2001
13 years 7 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...
SMA
2003
ACM
13 years 11 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
STOC
2003
ACM
14 years 6 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...