Unique coverage with rectangular regions

DOI10.1142/S0218195918500103MaRDI QIDQ4631010zbMATH OpenOpenAlexWikidataFDO

Authors Rom Aschner, Paz Carmi, Yael Stein

Publication date 24 April 2019

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195918500103

zbMATH Keywords

geometric coveringunique coverage

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40) Dynamic programming (90C39)

Recommendations

• Variable-Size Rectangle Covering
• A 4.31-approximation for the geometric unique coverage problem on unit disks
• A 4.31-approximation for the geometric unique coverage problem on unit disks
• A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
• A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares

Cites work

• A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
• Combination Can Be Hard: Approximability of the Unique Coverage Problem
• Covering rectilinear polygons with axis-parallel rectangles
• Covering Regions by Rectangles
• Do directional antennas facilitate in reducing interferences?
• Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions
• scientific article; zbMATH DE number 5764844 (Why is no real title available?)
• Spanning properties of graphs induced by directional antennas
• Switching to directional antennas with constant increase in radius and hop distance

Cited in

(2)

• Variable-Size Rectangle Covering
• Unique coverage in Boolean models

This page was built for publication: Unique coverage with rectangular regions

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