108 search results - page 5 / 22 » Constant-Work-Space Algorithm for a Shortest Path in a Simpl... |
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
DCG
2010
13 years 7 months ago
2010
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
ICPR
2000
IEEE
14 years 2 days ago
2000
IEEE
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
COMGEO
2000
ACM
13 years 7 months ago
2000
ACM
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...