CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
From MaRDI portal
Publication:4949994
DOI10.1142/S0218195999000212zbMath0959.68129MaRDI QIDQ4949994
Tomio Hirata, Yasuyoshi Inagaki, Xue-Hou Tan
Publication date: 8 February 2001
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (21)
Concerning the time bounds of existing shortest watchman route algorithms ⋮ Computing a shortest watchman path in a simple polygon in polynomial-time ⋮ A linear-time 2-approximation algorithm for the watchman route problem for simple polygons ⋮ An Improved On-line Strategy for Exploring Unknown Polygons ⋮ The touring rays and related problems ⋮ Improved exploration of unknown polygons ⋮ An improved algorithm for computing a shortest watchman route for lines ⋮ \(k\)-Transmitter watchman routes ⋮ Observation routes and external watchman routes ⋮ Complexity of minimum corridor guarding problems ⋮ Watchman routes for lines and line segments ⋮ Approximation algorithms for the watchman route and zookeeper's problems. ⋮ Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems ⋮ THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE ⋮ Online searching with an autonomous robot ⋮ Minimum-link watchman tours ⋮ Finding shortest safari routes in simple polygons ⋮ Polygon exploration with time-discrete vision ⋮ Optimal placement of base stations in border surveillance using limited capacity drones ⋮ The traveling salesmanpProblem for lines in the plane ⋮ Fast computation of shortest watchman routes in simple polygons
Cites Work
This page was built for publication: CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
