On Some Geometric Selection and Optimization Problems via Sorted Matrices

In this paper we apply the selection and optimization technique of Fredrickson and Johnson to a number of geometric selection and optimization problems, some of which have previously been solved by parametric search, and provide efficient and simple algorithms. Our technique improves the solutions obtained by parametric search by a log n factor. For example, we apply the technique to the two-line-center problem, where we want to find two strips that cover a given set S of n points in the plane, so as to minimize the width of the largest of the two strips.

[1]  Klara Kedem,et al.  Improvements on Geometric Pattern Matching Problems , 1992, SWAT.

[2]  Donald B. Johnson,et al.  Generalized Selection and Ranking: Sorted Matrices , 1984, SIAM J. Comput..

[3]  Jerzy W. Jaromczyk,et al.  The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure , 1995, WADS.

[4]  Jeffrey S. Salowe.  L-Infinity Interdistance Selection by Parametric Search , 1989, Inf. Process. Lett..

[5]  Dina Kravets,et al.  Selection and sorting in totally monotone arrays , 1990, SODA '90.

[6]  Bernard Chazelle.  New techniques for computing order statistics in Euclidean space (extended abstract) , 1985, SCG '85.

[7]  Subhash Suri,et al.  Finding tailored partitions , 1989, SCG '89.

[8]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[9]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[10]  Donald B. Johnson,et al.  The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns , 1982, J. Comput. Syst. Sci..

[11]  Donald B. Johnson,et al.  Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures , 1983, J. Algorithms.

[12]  Micha Sharir,et al.  An Expander-Based Approach to Geometric Optimization , 1997, SIAM J. Comput..

[13]  Mark H. Overmars,et al.  Maintenance of configurations in the plane (revised edition) , 1981 .

[14]  Godfried T. Toussaint,et al.  Computing the Width of a Set , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Matthew J. Katz.  Improved algorithms in geometric optimization via expanders , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[16]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[17]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[18]  Richard Cole,et al.  Searching and Storing Similar Lists , 2018, J. Algorithms.

[19]  Greg N. Frederickson,et al.  Optimal algorithms for tree partitioning , 1991, SODA '91.