Guarding terrains via local search

DOI10.20382/jocg.v5i1a9zbMath1404.68195OpenAlexW2129637633MaRDI QIDQ2968116

Gaurav Kanade, Erik A. Krohn, Kasturi R. Varadarajan, Matthew R. Gibson

Publication date: 9 March 2017

Full work available at URL: https://doaj.org/article/3ee893e9cfbf4dc2b2a9d16224ef4123

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Approximation algorithms (68W25)

Related Items (max. 100)

Parameterized Analysis of Art Gallery and Terrain Guarding ⋮ One-sided discrete terrain guarding and chordal graphs ⋮ Universal Guard Problems ⋮ On the geometric set multicover problem ⋮ On vertex guarding staircase polygons ⋮ Unnamed Item ⋮ One-sided terrain guarding and chordal graphs ⋮ Unnamed Item ⋮ Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. ⋮ Packing and covering with non-piercing regions ⋮ Limits of local search: quality and efficiency ⋮ Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parameterized complexity of geometric covering problems having conflicts ⋮ Local search strikes again: PTAS for variants of geometric covering and packing ⋮ On Partial Covering For Geometric Set Systems ⋮ Altitude terrain guarding and guarding uni-monotone polygons ⋮ Simple PTAS's for families of graphs excluding a minor ⋮ A constant-factor approximation algorithm for vertex guarding a WV-polygon ⋮ Parameter analysis for guarding terrains

This page was built for publication: Guarding terrains via local search