Covering Points by Disjoint Boxes with Outliers

  title={Covering Points by Disjoint Boxes with Outliers},
  author={Hee-Kap Ahn and S. Bae and E. Demaine and M. Demaine and Sang-Sub Kim and Matias Korman and Iris Reinbacher and W. Son},
  journal={Comput. Geom.},
For a set of n points in the plane, we consider the axis-aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n-k points. In this paper, we consider the boxes to be either squares or rectangles, and we want to minimize the area of the largest box. For general p we show that the problem is NP-hard for both squares and rectangles. For a small, fixed number p, we give algorithms that find the solution in the following running times: For… Expand
Covering many points with a small-area box
Smallest Square Covering k Points for Large Value of k
Matching colored points with rectangles
Variations of Enclosing Problem Using Axis Parallel Square(s): A General Approach
k-Enclosing Axis-Parallel Square
Computing a minimum-width square or rectangular annulus with outliers
  • S. Bae
  • Mathematics, Computer Science
  • Comput. Geom.
  • 2019


Enclosing k Points in the Smallest Axis Parallel Rectangle
Covering a Point Set by Two Disjoint Rectangles
Covering a set of points by two axis-parallel boxes
Rectilinear and polygonal p-piercing and p-center problems
Smallest k-point enclosing rectangle and square of arbitrary orientation
Covering a Set of Points in a Plane Using Two Parallel Rectangles
  • Chandan Saha, S. Das
  • Mathematics, Computer Science
  • 2007 International Conference on Computing: Theory and Applications (ICCTA'07)
  • 2007
Optimal Packing and Covering in the Plane are NP-Complete
Discrete rectilinear 2-center problems
On the Complexity of Some Common Geometric Location Problems