Concerning the time bounds of existing shortest watchman route algorithms

DOI10.1007/BFb0036185OpenAlexW2144420678MaRDI QIDQ5055936

Mikael Hammar, Bengt J. Nilsson

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0036185

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Complexity of minimum corridor guarding problems ⋮ Minimum-link watchman tours ⋮ Finding shortest safari routes in simple polygons ⋮ Fast computation of shortest watchman routes in simple polygons

Cites Work

• Shortest watchman routes in simple polygons
• Optimum watchman routes
• Finding the shortest watchman route in a simple polygon
• CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"

This page was built for publication: Concerning the time bounds of existing shortest watchman route algorithms