Watchman routes in the presence of a pair of convex polygons

DOI10.1016/S0020-0255(97)10033-0MaRDI QIDQ1291565zbMATH OpenOpenAlexFDO

Authors Laxmi P. Gewali, Simeon C. Ntafos

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)

Recommendations

• scientific article; zbMATH DE number 426139
• Shortest watchman routes in simple polygons
• Finding the shortest watchman route in a simple polygon
• A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
• Fast computation of shortest watchman routes in simple polygons
• scientific article; zbMATH DE number 177562
• OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
• Routing in a polygonal terrain with the shortest beacon watchtower
• Approximating watchman routes
• Computing a shortest watchman path in a simple polygon in polynomial-time

Cites work

• scientific article; zbMATH DE number 426139 (Why is no real title available?)
• scientific article; zbMATH DE number 432849 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 177562 (Why is no real title available?)
• scientific article; zbMATH DE number 193423 (Why is no real title available?)
• Art Gallery Problems for Convex Nested Polygons
• Computational complexity of art gallery problems
• Optimum watchman routes
• Shortest watchman routes in simple polygons

Cited in

(11)

• Watchman routes for lines and segments
• Optimum watchman routes
• scientific article; zbMATH DE number 426139 (Why is no real title available?)
• GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
• Watchman routes for lines and line segments
• Observation routes and external watchman routes
• Shortest watchman tours in simple polygons under rotated monotone visibility
• Observation routes and external watchman routes
• Watchman tours for polygons with holes
• Fast computation of shortest watchman routes in simple polygons
• On Romeo and Juliet problems: minimizing distance-to-sight

This page was built for publication: Watchman routes in the presence of a pair of convex polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291565)