## Touring a Sequence of Polygons (2003)

Venue: | In Proc. 35th Annu. ACM Sympos. Theory Comput |

Citations: | 30 - 4 self |

### BibTeX

@INPROCEEDINGS{Dror03touringa,

author = {Moshe Dror and Alon Efrat and Anna Lubiw and Joseph S. B. Mitchell},

title = {Touring a Sequence of Polygons},

booktitle = {In Proc. 35th Annu. ACM Sympos. Theory Comput},

year = {2003},

pages = {473--482},

publisher = {ACM Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

Given a sequence of k polygons in the plane, a start point s, and a target point, t, we seek a shortest path that starts at s, visits in order each of the polygons, and ends at t. If the polygons are disjoint and convex, we give an algorithm running in time O(kn log(n/k)), where n is the total number of vertices specifying the polygons. We also extend our results to a case in which the convex polygons are arbitrarily intersecting and the subpath between any two consecutive polygons is constrained to lie within a simply connected region; the algorithm uses O(nk log n) time. Our methods are simple and allow shortest path queries from s to a query point t to be answered in time O(k log n + m), where m is the combinatorial path length. We show that for nonconvex polygons this "touring polygons" problem is NP-hard.

### Citations

1775 | Computational Geometry: An Introduction - Preparata, Shamos - 1985 |

185 |
New Lower Bound Techniques for Robot Motion Planning Problems
- Canny, Reif
- 1987
(Show Context)
Citation Context ...orientations (axis-parallel, plus edges of angle 45 degrees) instead of just the two axis-parallel orientations, the problem becomes hard. The proof is based on a careful adaptation of the Canny-Reif =-=[4]-=- proof of NPhardness of the three-dimensional shortest path problem, using some new gadgets. Theorem 6. The touring polygons problem is NP-hard, for any Lp metric (p # 1), in the case of nonconvex pol... |

150 | Geometric Shortest Paths and Network Optimization
- Mitchell
- 2000
(Show Context)
Citation Context ... P i 's. If the order in which the polygons P i must be visited is not specified, then the touring polygons problem becomes the Traveling Salesperson Problem with Neighborhoods, which is NP-hard. See =-=[20]-=-. The touring polygons problem can be modeled as a special kind of 3-dimensional shortest path problem among polyhedral obstacles. Imagine k very large sheets of paper stacked up in parallel planes or... |

96 | Ray shooting in polygons using geodesic triangulations, Algorithmica 12 - Chazelle, Edelsbrunner, et al. - 1994 |

84 | A pedestrian approach to ray shooting: Shoot a ray, take a walk - Hershberger, Suri - 1995 |

82 |
Linear-time algorithms for visibility and shortest path problems inside a triangulated simple polygon, Algorithmica 2
- Guibas, Hershberger, et al.
- 1987
(Show Context)
Citation Context ... of S R i . We preprocess S A i-1 and S R i for point location queries. Constructing S F i . We preprocess F i for ray shooting queries; this takes O(|F i |) time, and allows queries in O(log n) time =-=[17]-=-. We call Query(v, S R i ), for each reflex vertex v of F i , to find the last edge l of a shortest fenced i-path to v ignoring the fence F i . Using a ray shooting query in F i , we determine if l is... |

80 | Approximation algorithms for shortest path motion planning, in
- Clarkson
- 1987
(Show Context)
Citation Context ...as the three-dimensional shortest path problem among obstacles. It is also "just as easy", in that known techniques to obtain an approximately shortest path among obstacles in three dimensio=-=ns (e.g., [1, 10, 11, 12, 22]) apply to-=- the TPP Figure 5: "Ganging" three shu#e gadgets in parallel. b = most significant bit 2 shortest path classes n i-1 shufflers (n-i+1) shufflers 1 3 4 6 1 3 4 6 4 5 2 3 3-way splitter 3-way ... |

77 | Visibility and intersection problems in plane geometry - Chazelle, Guibas - 1989 |

63 |
Optimum watchman routes
- Chin, Ntafos
- 1988
(Show Context)
Citation Context ...the starting point of the tour; the "floating" WRP, with no point s specified, requires time O(n) times that of the fixed WRP, as shown recently by Tan [26]. The WRP was introduced by Chin a=-=nd Ntafos [9, 7]-=-, who claimed in [7] an O(n 4 ) time algorithm for the fixed WRP in a simple polygon. However, years later, there was a flaw discovered in their algorithm, and several attempts were made to correct it... |

58 |
An algorithm for shortest path motion in three dimensions
- Papadimitriou
- 1985
(Show Context)
Citation Context ...as the three-dimensional shortest path problem among obstacles. It is also "just as easy", in that known techniques to obtain an approximately shortest path among obstacles in three dimensio=-=ns (e.g., [1, 10, 11, 12, 22]) apply to-=- the TPP Figure 5: "Ganging" three shu#e gadgets in parallel. b = most significant bit 2 shortest path classes n i-1 shufflers (n-i+1) shufflers 1 3 4 6 1 3 4 6 4 5 2 3 3-way splitter 3-way ... |

36 |
Shortest watchman routes in simple polygons
- Chin, Ntafos
- 1991
(Show Context)
Citation Context ...the starting point of the tour; the "floating" WRP, with no point s specified, requires time O(n) times that of the fixed WRP, as shown recently by Tan [26]. The WRP was introduced by Chin a=-=nd Ntafos [9, 7]-=-, who claimed in [7] an O(n 4 ) time algorithm for the fixed WRP in a simple polygon. However, years later, there was a flaw discovered in their algorithm, and several attempts were made to correct it... |

35 | Rectilinear shortest paths through polygonal obstacles in O(n(log n) 2 ) time - Clarkson, Kapoor, et al. - 1987 |

34 | Approximate Euclidean shortest paths in 3-space
- Choi, Sellen, et al.
- 1997
(Show Context)
Citation Context ...as the three-dimensional shortest path problem among obstacles. It is also "just as easy", in that known techniques to obtain an approximately shortest path among obstacles in three dimensio=-=ns (e.g., [1, 10, 11, 12, 22]) apply to-=- the TPP Figure 5: "Ganging" three shu#e gadgets in parallel. b = most significant bit 2 shortest path classes n i-1 shufflers (n-i+1) shufflers 1 3 4 6 1 3 4 6 4 5 2 3 3-way splitter 3-way ... |

34 |
routes under limited visibility
- Ntafos, Watchman
- 1992
(Show Context)
Citation Context ...blems seem di#erent from the TPP in that no ordering of the P i 's has been specified, it is easy to argue that a shortest tour must visit the P i 's in the same order as they meet the boundary of P (=-=[8, 21]-=-). The zookeeper problem, introduced by Chin and Ntafos [8], has an O(n log n) time algorithm [3] utilizing the full shortest path map. The safari problem was introduced by Ntafos [21], who claimed an... |

33 | Dynamic point location in general subdivision - Baumgarten, Jung, et al. - 1992 |

19 |
Fast computation of shortest watchman routes in simple polygons
- Tan
- 2001
(Show Context)
Citation Context ...r which our results imply an O(n 3 log n) algorithm (improving upon O(n 4 )). (Our results imply also an improved bound -- O(n 4 log n) instead of O(n 5 ) -- for the "floating" watchman rout=-=e problem [26]-=-.) One of the main significances of our new method is not just that it yields a substantially faster algorithm for the watchman route problem, but also that it avoids using dynamic programming and com... |

14 | Shortest path queries in rectilinear worlds - Berg, Kreveld, et al. - 1992 |

11 |
The zookeeper route problem
- Chin, Ntafos
- 1992
(Show Context)
Citation Context ...blems seem di#erent from the TPP in that no ordering of the P i 's has been specified, it is easy to argue that a shortest tour must visit the P i 's in the same order as they meet the boundary of P (=-=[8, 21]-=-). The zookeeper problem, introduced by Chin and Ntafos [8], has an O(n log n) time algorithm [3] utilizing the full shortest path map. The safari problem was introduced by Ntafos [21], who claimed an... |

10 | Pseudo approximation algorithms with applications to optimal motion planning, Discrete Comput
- Asano, Kirkpatrick, et al.
(Show Context)
Citation Context |

10 |
Finding shortest safari routes in simple polygons
- Tan, Hirata
- 2003
(Show Context)
Citation Context ... has an O(n log n) time algorithm [3] utilizing the full shortest path map. The safari problem was introduced by Ntafos [21], who claimed an O(n 3 ) time algorithm, which was then improved to O(n 2 ) =-=[24]-=-. However, Tan and Hirata [28] found an error in the earlier analysis and presented the current best algorithm with running time O(n 3 ). Our algorithm solves a much more general problem, and improves... |

9 | An efficient solution to the zookeeperâ€™s problem - Hershberger, Snoeyink - 1994 |

7 | Shortest zookeeper routes in simple polygons - Tan |

6 | An O(n log n) algorithm for the zoo-keepers problem
- Bespamyatnikh
(Show Context)
Citation Context ...argue that a shortest tour must visit the P i 's in the same order as they meet the boundary of P ([8, 21]). The zookeeper problem, introduced by Chin and Ntafos [8], has an O(n log n) time algorithm =-=[3]-=- utilizing the full shortest path map. The safari problem was introduced by Ntafos [21], who claimed an O(n 3 ) time algorithm, which was then improved to O(n 2 ) [24]. However, Tan and Hirata [28] fo... |

2 |
Polygon plate-cutting with a given order
- Dror
- 1999
(Show Context)
Citation Context ...ygons must be visited. (Certain applications specify the order in which parts must be cut; without a given order, the problem is obviously NP-hard.) This problem is known as the parts cutting problem =-=[16]-=-. The parts cutting problem is exactly the unconstrained TPP with disjoint P i 's and F i = R 2 , #i. Our algorithm solves the parts cutting problem in time O(kn log(n/k)); see Section 3. 2.2 The Safa... |

2 |
Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes
- Tan, Hirata, et al.
- 1999
(Show Context)
Citation Context ...ade to correct it (some of which were themselves flawed). The best current algorithm for the fixed WRP, based on a relatively complex dynamic programming algorithm, is due to Tan, Hirata, and Inagaki =-=[25]-=- and runs in time O(n 4 ). Our results imply a new, simpler algorithm for the fixed WRP that runs in time O(n 3 log n). In order to see that the WRP is a special case of the TPP, we recall the notion ... |