Optimum watchman routes

Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986

Volumn , Issue , 1986, Pages 24-33

  Chin, Wei Pang ^a   Ntafos, Simeon ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

CONVEX POLYGON; NP-HARD; SHORTEST ROUTE; SIMPLE POLYGON;

OPTIMIZATION;

EID: 85049018101     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/10515.10518     Document Type: Conference Paper

References (18)

1. D. Avis and G. Toussaint, "An Efficient Algorithm for Decomposing a Polygon into Star-Shaped Polygons, " Pattern Recognition, Vol. 13, No. 6, pp. 395-398, 1981.
2. V. Chvatal, "A Combinatorial Theorem in Plane Geometry, " Journal of Combinatorial Theory B, Vol. 18, pp. 39-41, 1975.
3. F. Chin and C. A. Wang, "Optimal Algorithms for the Intersection and Minimum Distance Problems Between Planar Polygons, " IEEE Trans. on Computers, Vol. 32, No. 12, pp. 1203-1207, 1983.
4. H. Edelsbrunner, "On Computing the Extreme Distances between Two Convex Polygons, " IIG, Technische Uviv. Graz, Austria, Rep. 96, 1982.
5. H. Edelsbrunner, J. O' Rourke and E. Wetzl, "Stationing Guards in Rectilinear Art Galleries, " Computer Vision, Graphics and Image Processing, Vol. 27, pp. 167-176, 1984.
6. S. Fisk, "A Short Proof of Chvatal's Watchman Theorem, " Journal of Combinatorial Theory B, Vol. 24, p. 374, 1978.
7. M. Garey and D. Johnson, Computers and Intractability: A Guide to Theory of NP-Completeness, Freeman, 1979.
8. M. Garey, D. Johnson, F. Preparata and R. Tarjan, "Triangulating a Simple Polygon, " Information Processing Letters, Vol. 7 (4), pp. 175-179, 1978.
9. J. Kahn, M. Klawe and D. Kleitman, "Traditional Galleries Require Fewer Watchmen, " SIAM Journal of Algebraic and Discrete Methods, Vol. 4, No. 2, pp. 194-206, 1983.
10. D. T. Lee and A. K. Lin, "Computational Complexity of Art Gallery Problems, " IEEE Trans. on Information Theory, to appear.
11. D. T. Lee and F. Preparata, "Euclidean Shortest Paths in the Presence of Rectilinear Barriers, " Networks, Vol. 14, pp. 393-410, 1984.
12. R. Liu and S. Ntafos, "On Partitioning Rectilinear Polygons into Rectilinear Parts, " UTD Tech. Rep. #218, 1985.
13. A. Lubiw, "Decomposing Polygons Into Convex Quadrilaterals, " Proc. ACM Symposium on Computational Geometry, June 1985, pp.97-i06.
14. S. Ntafos, "On Gallery Watchmen in Grids, " Information Processing Letters, to appear.
15. J. O' Rourke, "An Alternate Proof of the Rectilinear Art Gallery Theorem, " Journal of Geometry, Vol. 21, pp. 118-130, 1983.
16. J. O' Rourke, "Galleries Need Fewer Mobile Watchmen, " Geometriae Dedicata, Vol. 14, pp. 273-283, 1983.
17. C. Papadimitriou, "The Euclidean Traveling Salesman Problem is NPComplete, " Theoretical Computer Science, Vol. 4, pp. 237-244, 1977.
18. J. Sack, "An O(nlogn) Algorithm for Decomposing Simple Rectilinear Polygons into Convex Quadrilaterals", Proc. 20th Allerton Conference, 1982, pp. 64-74.