Covering a set of points in a plane using two parallel rectangles

DOI10.1016/j.ipl.2009.04.017zbMath1205.68470OpenAlexW2032549548MaRDI QIDQ989524

Sandip Das, Chandan Saha

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.04.017

zbMATH Keywords

optimizationalgorithmscoveringcomputational geometryrectangles

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Covering points by disjoint boxes with outliers ⋮ Covering points with convex sets of minimum size ⋮ Discrete unit square cover problem ⋮ Optimizing squares covering a set of points ⋮ Covering Points with Convex Sets of Minimum Size

Cites Work

• Covering a set of points by two axis-parallel boxes
• On some geometric selection and optimization problems via sorted matrices
• Discrete rectilinear 2-center problems
• Determining the minimum-area encasing rectangle for an arbitrary closed curve

This page was built for publication: Covering a set of points in a plane using two parallel rectangles