Optimum watchman routes

Information Processing Letters

Volumn 28, Issue 1, 1988, Pages 39-44

  Chin, Wei pang ^a   Ntafos, Simeon ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

Computational geometry; watchman problem

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL TECHNIQUES - GEOMETRY;

COMPUTATIONAL GEOMETRY; NP-HARD PROBLEMS; OPTIMUM WATCHMAN ROUTES;

OPTIMIZATION;

EID: 0024012683     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(88)90141-X     Document Type: Article

References (8)

1. Watchman Routes in Simple Polygons
2. Triangulating Simple Polygons and Equivalent Problems
3. Path Planning in 0/1 Weighted Regions and Applications
4. Linear time algorithms for visibility and shortest path problems inside simple polygons
5. The Euclidean traveling salesman problem is NP-complete