Covering a set of points in a plane using two parallel rectangles
From MaRDI portal
Recommendations
- Covering a point set by two disjoint rectangles
- Covering a Point Set by Two Disjoint Rectangles
- Covering a set of points by two axis-parallel boxes
- On point covers of parallel rectangles
- Covering rectilinear polygons with axis-parallel rectangles
- Covering Rectilinear Polygons with Axis-Parallel Rectangles
- On point covers of multiple intervals and axis-parallel rectangles
- Covering a Set of Points with a Minimum Number of Lines
- scientific article; zbMATH DE number 2145233
- Covering points with orthogonal polygons
Cites work
Cited in
(11)- Discrete unit square cover problem
- Placing two axis-parallel squares to maximize the number of enclosed points
- Covering points by disjoint boxes with outliers
- Covering points with convex sets of minimum size
- Covering a point set by two disjoint rectangles
- Covering a Point Set by Two Disjoint Rectangles
- Covering a set of points by two axis-parallel boxes
- Optimizing squares covering a set of points
- Optimal covering and hitting of line segments by two axis-parallel squares
- Covering Points with Convex Sets of Minimum Size
- On point covers of parallel rectangles
This page was built for publication: Covering a set of points in a plane using two parallel rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989524)