Guarding points on a terrain by watchtowers

DOI10.1016/J.COMGEO.2025.102210MaRDI QIDQ6869428zbMATH OpenFDO

Authors Byeonguk Kang, Junhyeok Choi, Jeesun Han, Hee-Kap Ahn

Publication date 22 January 2026

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COMGEO.2025.102210

zbMATH Keywords

guardingterrainwatchtower

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A combinatorial theorem in plane geometry
• A short proof of Chvatal's Watchman Theorem
• Computational geometry. Algorithms and applications.
• Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
• Geographical information systems and location science
• Guarding a terrain by two watchtowers
• Guarding polyhedral terrain by k-watchtowers
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 1796960 (Why is no real title available?)
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Optimal shortest path queries in a simple polygon
• Terrain guarding is NP-hard
• The shortest watchtower and related problems for polyhedral terrains

This page was built for publication: Guarding points on a terrain by watchtowers

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