Watchman routes in the presence of a pair of convex polygons

DOI10.1016/S0020-0255(97)10033-0zbMath0947.68155OpenAlexW2020982884MaRDI QIDQ1291565

Simeon C. Ntafos, Laxmi P. Gewali

Publication date: 10 June 1999

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(97)10033-0

zbMATH Keywords

shortest watchman route problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Observation routes and external watchman routes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shortest watchman routes in simple polygons
• Optimum watchman routes
• Computational complexity of art gallery problems
• Art Gallery Problems for Convex Nested Polygons