
...approximate algorithms which calculate the euclidean shortest path (esp) within a given cubecurve with arbitrary accuracy, defined by " > 0, and in time complexity (") · o(n), where (") is the length dierence between the path used for initialization and the minimum length path, divided by ". a runtime diagram also illustrates...

...union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. the curve's length is defined to...design of algorithms for calculation a 3d mlp of a cubecurve: is there a simple cubecurve such that none of the...

...we consider simple cubecurves in the orthogonal 3d grid. the union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. the curve's length is defined to...

...if all spaces to move in form a simple cubecurve. the shortest path through a sim ple cubecurve in the orthogonal 3d grid is...had success fully treated only a very special case of simple cubecurves before). in a previous paper, the authors also...

...definition of the length of a digitized curve in 3d is the length of the shortest polygonal curve lying entirely
in a cube curve. in earlier work the authors proposed...by directly calculating mlpvertices in specific situations. altogether, the paper suggests an
indepth analysis of cube curves.
...

...and kimmel, 1997) on finding a contour as a minimal path between two end points, shortest
paths in volume images have raised interest in computer vision and image analysis. this paper considers the calculation of
a euclidean shortest path (esp) in a threedimensional (3d) polyhedral space...

...proposed by billow and klette in 20002002 for the calculation of minimumlength polygonal curves in cubecurves in 3d space. the paper describes...calculating the esp inside of a simple cube arc, inside of a simple polygon, on the surface of a convex polytope, or inside of...

...that pi is given as a triangulated surface which is not necessary simply connected.based on a known kshortest paths algorithm and a decomposition of the surrounding region...an approximate algorithm for computing a general euclidean shortest path (esp) between two points p...

...union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. the curve's length is defined to...calculation of the mlp of a simple cubecurve: is there a simple cube curve such that none of the...

...and q be two points in a simple polygon . an open problem in computational geometry asks to devise a simple lineartime algorithm for computing a shortest path between p and q, which is con tained in , such that the algorithm does not depend on a (complicated) lineartime triangulation algorithm...