Abstract
This paper investigates the existence of linear space data structures for range searching. We examine thehomothetic range search problem, where a setS ofn points in the plane is to be preprocessed so that for any triangleT with sides parallel to three fixed directions the points ofS that lie inT can be computed efficiently. We also look atdomination searching in three dimensions. In this problem,S is a set ofn points inE 3 and the question is to retrieve all points ofS that are dominated by some query point. We describe linear space data structures for both problems. The query time is optimal in the first case and nearly optimal in the second.
Article PDF
Similar content being viewed by others
References
J. L. Bentley, Multidimensional divide and conquer,Comm. ACM 23 (1980), 214–229.
B. Chazelle, Filtering search: a new approach to query-answering,SIAM J. Comput. 15 (1986), 703–724.
B. Chazelle, A Functional Approach to Data Structures and Its Use in Multidimensional Searching, Technical Report No. CS-85-16, Brown University, 1985. Preliminary version inProceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 165–174, 1985.
B. Chazelle, Lower bounds on the complexity of multidimensional searching,Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, 87–96, 1986.
B. Chazelle and H. Edelsbrunner, Optimal solutions for a class of point retrieval problems,J. Symbolic Comput. 1 (1985), 47–56.
B. Chazelle and L. J. Guibas, Fractional cascading: I. A data structuring technique,Algorithmica 1 (1986), 133–162.
B. Chazelle, L. J. Guibas, and D. T. Lee, The power of geometric duality,Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, 217–225, 1983. Also inBIT 25 (1985), 76–90.
D. P. Dobkin and H. Edelsbrunner, Space searching for interesting objects,Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, 387–392, 1984.
H. Edelsbrunner and E. Welzl, Halfplanar range search in linear space andO(n 0.695) query time,Inform. Process. Lett., to appear.
H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision,SIAM J. Comput. 15 (1986), 317–340.
H. N. Gabow, J. L. Bentley, and R. E. Tarjan, Scaling and related techniques for geometry problems,Proceedings of the 16th Annual ACM Symposium on Theory of Computation, 135–143, 1984.
L. J. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams,ACM Trans. Graphics 4 (1985), 74–123.
D. G. Kirkpatrick, Optimal search in planar subdivisions,SIAM J. Comput. 12 (1983), 28–35.
H. T. Kung, F. Luccio, and F. P. Preparata, On finding the maxima of a set of vectors,J. Assoc. Comput. Mach. 22 (1975), 469–476.
R. J. Lipton and R. E. Tarjan, Applications of a planar separator theorem,SIAM J. Comput. 9 (1980), 615–627.
E. M. McCreight, Priority search trees,SIAM. J. Comput. 14 (1985), 257–276.
D. E. Muller and F. P. Preparata, Finding the intersection of two convex polyhedra,Theoret. Comput. Sci. 7 (1978), 217–236.
D. E. Willard, Polygon retrieval,SIAM J. Comput. 11 (1982), 149–165.
F. F. Yao, A 3-space partition and its applications,Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 258–263, 1983.
Author information
Authors and Affiliations
Additional information
Communicated by David Dobkin
This research was conducted while the first author was with Brown University and the second author was with the Technical University of Graz, Austria. The first author was supported in part by NSF Grant MCS 83-03925.
Rights and permissions
About this article
Cite this article
Chazelle, B., Edelsbrunner, H. Linear space data structures for two types of range search. Discrete Comput Geom 2, 113–126 (1987). https://doi.org/10.1007/BF02187875
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187875