Covering a set of points in a plane using two parallel rectangles
From MaRDI portal
Publication:989524
DOI10.1016/j.ipl.2009.04.017zbMath1205.68470MaRDI QIDQ989524
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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Discrete unit square cover problem, Covering points by disjoint boxes with outliers, Covering points with convex sets of minimum size, Optimizing squares covering a set of points, Covering Points with Convex Sets of Minimum Size
Cites Work