Covering a set of points by two axis-parallel boxes

DOI10.1016/S0020-0190(00)00093-4MaRDI QIDQ294806zbMATH OpenFDO

Authors Sergei Bespamyatnikh, Michael Segal

Publication date 16 June 2016

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

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019000000934?np=y

zbMATH Keywords

optimizationalgorithmscomputational geometryaxis-parallel boxes

Mathematics Subject Classification ID

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

Recommendations

• Covering a set of points in a plane using two parallel rectangles
• Covering boxes by points
• Covering a point set by two disjoint rectangles
• Covering a Point Set by Two Disjoint 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 with Euclidean boxes
• Covering many points with a small-area box
• On point covers of parallel rectangles

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 177549 (Why is no real title available?)
• scientific article; zbMATH DE number 867650 (Why is no real title available?)
• Constrained square-center problems
• Finding tailored partitions
• On piercing sets of axis-parallel rectangles and rings
• On some geometric selection and optimization problems via sorted matrices
• The complexity of selection and ranking in X+Y and matrices with sorted columns

Cited in

(16)

• Planar maximum box problem
• Placing two axis-parallel squares to maximize the number of enclosed points
• Square and Rectangle Covering with Outliers
• Enclosing many boxes by an optimal pair of boxes
• New Algorithms for k-Center and Extensions
• Covering points by disjoint boxes with outliers
• Covering points with convex sets of minimum size
• Covering a set of points in multidimensional space
• Covering boxes by points
• Covering a point set by two disjoint rectangles
• Covering many points with a small-area box
• Covering a set of points in a plane using two parallel rectangles
• The area of empty axis-parallel boxes amidst 2-dimensional lattice points
• New algorithms for \(k\)-center and extensions
• Covering Points with Convex Sets of Minimum Size
• A mixed integer formulation for maximal covering by inclined parallelograms

This page was built for publication: Covering a set of points by two axis-parallel boxes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294806)