108 search results - page 1 / 22 » Constant-Work-Space Algorithm for a Shortest Path in a Simpl... |
WALCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
PAAPP
1998
13 years 4 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
CCCG
2010
13 years 6 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
CCCG
2010
13 years 6 months ago
2010
So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3...
FAW
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...