Covering a point set by two disjoint rectangles
From MaRDI portal
Publication:3089094
DOI10.1142/S0218195911003676zbMATH Open1228.65089OpenAlexW2024500486MaRDI QIDQ3089094FDOQ3089094
Authors: Sang-Sub Kim, Sang Won Bae, Hee-Kap Ahn 
Publication date: 23 August 2011
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195911003676
Recommendations
Numerical mathematical programming methods (65K05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Generalized Selection and Ranking: Sorted Matrices
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- The polygon exploration problem
- Covering a set of points by two axis-parallel boxes
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Discrete rectilinear 2-center problems
- Computing minimum-area rectilinear convex hull and \(L\)-shape
- An Expander-Based Approach to Geometric Optimization
- OPTIMAL LINE BIPARTITIONS OF POINT SETS
Cited In (17)
- Covering a Point Set by Two Disjoint Rectangles
- Optimizing squares covering a set of points
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
- Optimizing squares covering a set of points
- Covering point sets with two disjoint disks or squares
- On rectangular covering problems
- Covering uncertain points in a tree
- Variable-Size Rectangle Covering
- Covering a set of points by two axis-parallel boxes
- Title not available (Why is that?)
- Covering a set of points in a plane using two parallel rectangles
- Covering points with convex sets of minimum size
- Algorithms for Rectangular Covering Problems
- Covering Points with Convex Sets of Minimum Size
- Optimal covering and hitting of line segments by two axis-parallel squares
- Covering points by disjoint boxes with outliers
- Discrete and mixed two-center problems for line segments
This page was built for publication: Covering a point set by two disjoint rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089094)
