Touring a sequence of polygons

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 473-482

  Dror, Moshe ^a   Lubiw, Anna ^b   Efrat, Alon ^a   Mitchell, Joseph S B ^c  

^a UNIVERSITY OF ARIZONA   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c STONY BROOK UNIVERSITY   (United States)

Author keywords

NP hardness; Polygons; Safari route; Shortest path; Traveling salesman problem; Watchman route

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

POLYGONS;

COMPUTATIONAL GEOMETRY;

EID: 0038446919     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780612     Document Type: Conference Paper

References (28)

1. T. Asano, D. Kirkpatrick and C. Yap. Pseudo approximation algorithms, with applications to optimal motion planning. In Proc. 18th Annu. ACM Sympos. Comput. Geom., 2002, 170-178.
2. H. Baumgarten, H. Jung and K. Mehlhorn. Dynamic point location in general subdivisions. J. Algorithms, 17:342-380, 1994.
3. S. Bespamyatnikh. An O(n log n) algorithm for the zoo-keeper's problem. Computational Geometry: Theory and Applications, 24:63-74, 2002.
4. J. Canny and J. H. Reif. New lower bound techniques for robot motion planning problems. In Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci., 1987, 49-60.
5. B. Chazelle, H. Edelsbrunner, M. Grigni, L. J. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink. Ray shooting in polygons using geodesic triangulations. Algorithmica, 12:54-68, 1994.
6. B. Chazelle and L. J. Guibas. Visibility and intersection problems in plane geometry. Discrete Comput. Geom., 4:551-581, 1989.
7. W.-P. Chin and S. Ntafos. Shortest watchman routes in simple polygons. Discrete Comput. Geom., 6:9-31, 1991.
8. W.-P. Chin and S. Ntafos. The zookeeper route problem. Information Sciences, 63:245-259, 1992.
9. W. Chin and S. Ntafos. Optimum watchman routes. Information Processing Letters, 28:39-44, 1998.
10. J. Choi, J. Seilen, and C. K. Yap. Approximate Euclidean shortest paths in 3-space. Internat. J. Comput. Geom. Appl., 7:271-295, 1997.
11. J. Choi, J. Sellen, and C. K. Yap. Precision-sensitive Euclidean shortest path in 3-space. In Proc. 11th Annu. ACM Sympos. Comput. Geom., 1995, 350-359.
12. K. L. Clarkson. Approximation algorithms for shortest path motion planning. In Proc. 19th Annu. ACM Sympos. Theory Comput., 1987, 56-65.
13. 2) time. In Proc. 3rd Annu. ACM Sympos. Comput. Geom., 1987, 251-257.
14. M. de Berg, M. van Kreveld, and B. J. Nilsson. Shortest path queries in rectilinear worlds of higher dimension. In Proc. 7th Annu. ACM Sympos. Comput. Geom., 1991, 51-60.
15. M. de Berg, M. van Kreveld, B. J. Nilsson, and M. H. Overmars. Shortest path queries in rectilinear worlds. Internat. J. Comput. Geom. Appl., 2:287-309, 1992.
16. M. Dror. Polygon plate-cutting with a given order. IIE Transactions, 31:271-274, 1999.
17. L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209-233, 1987.
18. J. Hershberger and J. Snoeyink. An efficient solution to the zookeeper's problem. In Proc. 6th Canadian Conf. on Comp. Geometry, 1994, 104-109.
19. J. Hershberger and S. Suri. A pedestrian approach to ray shooting: shoot a ray, take a walk. J. Algorithms, 18:403-431, 1995.
20. J. S. B. Mitchell, Geometric shortest paths and network optimization, In Handbook of Computational Geometry (J.-R. Sack and J. Urrutia, eds.), pages 633-701, Elsevier Science, 2000.
21. S. Ntafos. Watchman routes under limited visibility. Comput, Geom. Theory Appl., 1:149-170, 1992.
22. C. H. Papadimitriou. An algorithm for shortest-path motion in three dimensions. Inform. Process. Lett., 20:259-263, 1985.
23. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
24. X. Tan and T. Hirata. Shortest safari routes in simple polygons. Lecture Notes in Computer Science, Vol. 834, 1994, 523-531.
25. X. Tan, T. Hirata, and Y. Inagaki. Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes". International J. of Comp. Geom. and App., 9:319-323, 1999.
26. X. Tan. Fast computation of shortest watchman routes in simple polygons. Information Processing Letters, 77:27-33, 2001.
27. X. Tan. Shortest zookeeper's routes in simple polygons. Information Processing Letters, 77:23-26, 2001.
28. X. Tan and T. Hirata. Finding shortest safari routes in simple polygons. Manuscript (submitted), Tokai University, 2001.