A linear-time 2-approximation algorithm for the watchman route problem for simple polygons

DOI10.1016/j.tcs.2007.05.021zbMath1124.68118OpenAlexW2065318495MaRDI QIDQ2382287

Xue-Hou Tan

Publication date: 28 September 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.05.021

zbMATH Keywords

computational geometryapproximation algorithmspolygon visibilitywatchman route problemessential cuts

Mathematics Subject Classification ID

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

Related Items (5)

Touring a sequence of disjoint polygons: complexity and extension ⋮ Improved exploration of unknown polygons ⋮ Observation routes and external watchman routes ⋮ Complexity of minimum corridor guarding problems ⋮ Watchman routes for lines and line segments

Cites Work

• Finding an approximate minimum-link visibility path inside a simple polygon
• LR-visibility in polygons
• Visibility and intersection problems in plane geometry
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Optimum watchman routes
• Approximation algorithms for the watchman route and zookeeper's problems.
• Fast computation of shortest watchman routes in simple polygons
• Finding the shortest watchman route in a simple polygon
• Touring a sequence of polygons
• AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
• Characterizing LR-visibility polygons and related problems

This page was built for publication: A linear-time 2-approximation algorithm for the watchman route problem for simple polygons