Abstract
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.
The work of the second author was supported by AFOSR Grant AFOSR-91-0328, while working at the Department of Computer Science at Cornell University, Ithaca 14853, NY
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Agarwal and M. Sharir. “Planar geometric location problems”, Algorithmica, 11(1994), pp 185–195.
M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest and Tarjan, R.E. “Time bounds for selection”, J. Comput. Syst. Sci., 7(1972), pp. 448–461.
R. Cole. “Searching and storing similar lists”, J. Comput. Syst. Sci., 23(1981), pp. 166–204.
B. Chazelle. “New techniques for computing order statistics in Euclidean space”, Proc. 1st ACM Symp. on Computational Geometry, 1985, pp. 125–134.
L. P. Chew and K. Kedem. “Improvements on Geometric Pattern Matching Problems”, SWAT, LNCS 621, Springer-Verlag, 1992, pp. 318–325.
G.N. Frederickson. “Optimal algorithms for tree partitioning”, Proc. 2nd ACM-SIAM. Symp. on Discrete Algorithms, 1991, pp. 168–177.
G. N. Frederickson and D. B. Johnson. “The complexity of selection and ranking in X+Y and matrices with sorted columns”, J. Comput. Syst. Sci., 24(1982), pp. 197–208.
G. N. Frederickson and D. B. Johnson. “Finding k th paths and p-center by generating and searching good data structures”, J. Algorithms, 4(1983), pp. 61–80.
G. N. Frederickson and D. B. Johnson. “Generalized selection and ranking: sorted matrices.”, SIAM J. Computing, 13(1984), pp. 14–30.
M. Houle and G. Toussaint, “Computing the width of a set”, Proc. 1st ACM Symp. on Computational Geometry, 1985, pp. 1–7.
J. Hershberger and S. Suri. “Finding Tailored Partitions”, J. Algorithms, 12(1991), pp. 431–463.
M.J. Katz, “Improved algorithms in geometric optimization via expanders”, Proc. 3rd Israel Symposium on Theory of Computing and Systems, 1995, to appear.
D. Kravets and J. Park. “Selection and Sorting in Totally Monotone Arrays”, Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 494–502.
M.J. Katz and M. Sharir, “An expander-based approach to geometric optimization”, Proc. 9th ACM Symp. on Computational Geometry, 1993, pp. 198–207.
N. Megiddo. “Applying parallel computation algorithms in the design of serial algorithms.”, J. ACM, 30(1983), pp. 852–865.
J. S. Salowe. “L-infinity interdistance selection by parametric search”, Inf. Proc. Lett., 30(1989), pp. 9–14.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Glozman, A., Kedem, K., Shpitalnik, G. (1995). On some geometric selection and optimization problems via sorted matrices. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_48
Download citation
DOI: https://doi.org/10.1007/3-540-60220-8_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60220-0
Online ISBN: 978-3-540-44747-4
eBook Packages: Springer Book Archive