A Scheme for Computing Minimum Covers within Simple Regions

Authors:
Matthew J. Katz;Gila Morgenstern
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105
Venue:
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Year:
2009

Citing 12
Cited 3

Perfect graphs and orthogonally convex covers

SIAM Journal on Discrete Mathematics
Covering orthogonal polygons with star polygons: the perfect graph approach

Journal of Computer and System Sciences
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees

Journal of the ACM (JACM)
Two-Dimensional Voronoi Diagrams in the Lp-Metric

Journal of the ACM (JACM)
Voronoi diagrams based on convex distance functions

SCG '85 Proceedings of the first annual symposium on Computational geometry
The 2-center problem with obstacles

Journal of Algorithms
Selecting forwarding neighbors in wireless ad hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Minimum-cost coverage of point sets by disks

Proceedings of the twenty-second annual symposium on Computational geometry
On guarding the vertices of rectilinear domains

Computational Geometry: Theory and Applications
Covering points by unit disks of fixed location

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

Optimal cover of points by disks in a simple polygon

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Optimal Cover of Points by Disks in a Simple Polygon

SIAM Journal on Computing
Evolutionary algorithm for optimal anchor node placement to localize devices in a mobile ad hoc network during building evacuation

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let X be a simple region (e.g., a simple polygon), and let Q be a set of points in X . Let O be a convex object, such as a disk, a square, or an equilateral triangle. We present a scheme for computing a minimum cover of Q with respect to X , consisting of homothetic copies of O . In particular, a minimum disk cover of Q with respect to X , can be computed in polynomial time.