On Isolating Points Using Disks

DOI10.1007/978-3-642-23719-5_6MaRDI QIDQ3092217zbMATH OpenOpenAlexFDO

Authors Gaurav Kanade, Matt Gibson, Kasturi Varadarajan

Publication date 16 September 2011

Published in Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23719-5_6

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• On isolating points using unit disks
• On covering a set of points by disks
• scientific article; zbMATH DE number 6139736
• Covering Points by Unit Disks of Fixed Location
• Covering Many or Few Points with Unit Disks
• Covering many or few points with unit disks
• Covering point sets with two disjoint disks or squares
• Isolating points by lines in the plane
• scientific article; zbMATH DE number 66675
• On conditions for the separation of points of the unit disc

Cited in

(7)

• The complexity of separating points in the plane
• On the complexity of barrier resilience for fat regions and bounded ply
• On the area of the intersection of disks in the plane
• Cutting disjoint disks by straight lines
• On isolating points using unit disks
• Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience
• Two optimization problems for unit disks

This page was built for publication: On Isolating Points Using Disks

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