Watchman routes in the presence of a pair of convex polygons
From MaRDI portal
Publication:1291565
DOI10.1016/S0020-0255(97)10033-0zbMATH Open0947.68155OpenAlexW2020982884MaRDI QIDQ1291565FDOQ1291565
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shortest watchman routes in simple polygons
- Optimum watchman routes
- Art Gallery Problems for Convex Nested Polygons
- Computational complexity of art gallery problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- On Romeo and Juliet problems: minimizing distance-to-sight
- Title not available (Why is that?)
- Shortest watchman tours in simple polygons under rotated monotone visibility
- Watchman routes for lines and segments
- Optimum watchman routes
- Watchman tours for polygons with holes
- Observation routes and external watchman routes
- Fast computation of shortest watchman routes in simple polygons
- Watchman routes for lines and line segments
- Observation routes and external watchman routes
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
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)
