MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS
From MaRDI portal
Publication:4650087
DOI10.1142/S021819591100386XzbMath1251.68276MaRDI QIDQ4650087
A. Karim Abu-Affash, Paz Carmi, Gila Morgenstern, Matthew J. Katz
Publication date: 23 November 2012
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Combinatorial complexity of geometric structures (52C45)
Related Items (4)
Fault-tolerant covering problems in metric spaces ⋮ Approximation algorithms for the minimum power cover problem with submodular/linear penalties ⋮ Anchored rectangle and square packings ⋮ Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
Cites Work
- On metric clustering to minimize the sum of radii
- Ray shooting in polygons using geodesic triangulations
- Clustering to minimize the sum of cluster diameters
- Polynomial time approximation schemes for base station coverage with minimum total radii
- On the hardness of approximating minimization problems
- Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
This page was built for publication: MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS
