Discrete rectilinear 2-center problems
From MaRDI portal
Publication:1975961
DOI10.1016/S0925-7721(99)00052-8zbMath0952.68146MaRDI QIDQ1975961
Klara Kedem, Matthew J. Katz, Michael Segal
Publication date: 8 May 2000
Published in: Computational Geometry (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Square and Rectangle Covering with Outliers, Covering points by disjoint boxes with outliers, Cache-oblivious selection in sorted \(X+Y\) matrices, Covering a set of points in a plane using two parallel rectangles, 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, Efficient algorithms for computing one or two discrete centers hitting a set of line segments, A simple linear algorithm for computing rectilinear 3-centers, Optimizing Squares Covering a Set of Points, COVERING A POINT SET BY TWO DISJOINT RECTANGLES