scientific article
From MaRDI portal
Publication:2970453
zbMath1405.68417arXiv1509.08285MaRDI QIDQ2970453
No author found.
Publication date: 30 March 2017
Full work available at URL: https://arxiv.org/abs/1509.08285
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Integer programming (90C10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (11)
Solving the minimum convex partition of point sets with integer programming ⋮ Parameterized Analysis of Art Gallery and Terrain Guarding ⋮ One-sided discrete terrain guarding and chordal graphs ⋮ An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization ⋮ A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem ⋮ On Voronoi visibility maps of 1.5D terrains with multiple viewpoints ⋮ One-sided terrain guarding and chordal graphs ⋮ Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains ⋮ Altitude terrain guarding and guarding uni-monotone polygons ⋮ A constant-factor approximation algorithm for vertex guarding a WV-polygon ⋮ Parameter analysis for guarding terrains
This page was built for publication: