COVERING A POINT SET BY TWO DISJOINT RECTANGLES

DOI10.1142/S0218195911003676zbMath1228.65089OpenAlexW2024500486MaRDI QIDQ3089094

Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim

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

zbMATH Keywords

geometric optimizationbipartitiondisjoint rectanglestwo-box covering

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (7)

Optimizing Squares Covering a Set of Points ⋮ Discrete and mixed two-center problems for line segments ⋮ Covering points with convex sets of minimum size ⋮ 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 Points with Convex Sets of Minimum Size ⋮ Covering uncertain points in a tree

Cites Work

• Covering a set of points by two axis-parallel boxes
• Computing minimum-area rectilinear convex hull and \(L\)-shape
• Discrete rectilinear 2-center problems
• The Polygon Exploration Problem
• Generalized Selection and Ranking: Sorted Matrices
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• An Expander-Based Approach to Geometric Optimization
• OPTIMAL LINE BIPARTITIONS OF POINT SETS

This page was built for publication: COVERING A POINT SET BY TWO DISJOINT RECTANGLES