Abstract
The range-searching problems that allow efficient partition trees are characterized as those defined by range spaces of finite Vapnik-Chervonenkis dimension. More generally, these problems are shown to be the only ones that admit linear-size solutions with sublinear query time in the arithmetic model. The proof rests on a characterization of spanning trees with a low stabbing number. We use probabilistic arguments to treat the general case, but we are able to use geometric techniques to handle the most common range-searching problems, such as simplex and spherical range search. We prove that any set ofn points inE d admits a spanning tree which cannot be cut by any hyperplane (or hypersphere) through more than roughlyn 1−1/d edges. This result yields quasi-optimal solutions to simplex range searching in the arithmetic model of computation. We also look at polygon, disk, and tetrahedron range searching on a random access machine. Givenn points inE 2, we derive a data structure of sizeO(n logn) for counting how many points fall inside a query convexk-gon (for arbitrary values ofk). The query time isO(√kn logn). Ifk is fixed once and for all (as in triangular range searching), then the storage requirement drops toO(n). We also describe anO(n logn)-size data structure for counting how many points fall inside a query circle inO(√n log2 n) query time. Finally, we present anO(n logn)-size data structure for counting how many points fall inside a query tetrahedron in 3-space inO(n 2/3 log2 n) query time. All the algorithms are optimal within polylogarithmic factors. In all cases, the preprocessing can be done in polynomial time. Furthermore, the algorithms can also handle reporting within the same complexity (adding the size of the output as a linear term to the query time).
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alon, N., Haussler, D., Welzl, E., Wöginger, G. Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension,Proc. 3rd Ann. ACM Symp. Comput. Geom. (1987), 331–340.
Assouad, P. Densité et dimension,Ann. Inst. Fourier (Grenoble) 33 (1983), 233–282.
Chazelle, B. Polytope range searching and integral geometry,Proc. 28th Ann. IEEE Symp. Found. Comput. Sci. (1987), 1–10. To appear inJ. Amer. Math. Soc.
Chazelle, B., Guibas, L. J. Visibility and intersection problems in plane geometry,Proc. 1st Ann. ACM Symp. Comput. Geom. (1985), 135–146. To appear inDiscrete Comput. Geom.
Dobkin, D. P., Kirkpatrick, D. G. Fast detection of polyhedral intersection,Theoret. Comput. Sci. 27 (1983), 241–253.
Dudley, R. M. Central limit theorems for empirical measures,Ann. Probab. 6 (1978), 899–929.
Edelsbrunner, H.Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
Edelsbrunner, H., Guibas, L. J., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., Welzl, E. Implicitly representing arrangements of lines or segments.Proc. 4th Ann. ACM Symp. Comput. Geom. (1988), 56–69.
Edelsbrunner, H., Welzl, E. Halfplanar range search in linear space andO(n 0.695) query time,Inform. Process. Lett. 23 (1986), 289–293.
Fredman, M. L. Lower bounds on the complexity of some optimal data structures,SIAM J. Comput. 10 (1981), 1–10.
Haussler, D., Welzl, E. Epsilon-nets and simplex range queries,Discrete Comput. Geom. 2 (1987), 127–151.
Matoušek, J. Spanning trees with low stabbing numbers, manuscript, 1988.
Mehlhorn, K.Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry, Springer-Verlag, Heidelberg, 1984.
Monier, L. Combinatorial solutions of multidimensional divide-and-conquer recurrences,J. Algorithms 1 (1980), 60–74.
Preparata, F. P., Shamos, M. I.Computational Geometry, Springer-Verlag, New York, 1985.
Sauer, N. On the density of families of sets,J. Combin. Theory Ser. A 13 (1972), 145–147.
Tarjan, R. E. Efficiency of a good but not linear set union algorithm,J. Assoc. Comput. Geom. 22 (1975), 215–225.
Vapnik, V. N., Chervonenkis, A. Ya. On the uniform convergence of relative frequencies of events to their probabilities,Theory Probab. Appl. 16 (1971), 264–280.
Welzl, E., Wöginger, G. On shatter functions of range spaces, manuscript, 1987.
Willard, D. E. Polygon retrieval,SIAM J. Comput. 11 (1982), 149–165.
Yao, A. C. Space-time tradeoff for answering range queries,Proc. 14th Ann. ACM Symp. Theory Comput. (1982), 128–136.
Yao, A. C. On the complexity of maintaining partial sums,SIAM J. Comput. 14 (1985), 277–288.
Yao, A. C., Yao, F. F. A general approach tod-dimensional geometric queries,Proc. 17th Ann. ACM Symp. Theory Comput. (1985), 163–168.
Yao, F. F. A 3-space partition and its applications.Proc. 15th Ann. ACM Symp. Theory Comput. (1983), 258–263.
Author information
Authors and Affiliations
Additional information
Portions of this work have appeared in preliminary form in “Partition trees for triangle counting and other range searching problems” (E. Welzl),Proc. 4th Ann. ACM Symp. Comput. Geom. (1988), 23–33, and “Tight Bounds on the Stabbing Number of Spanning Trees in Euclidean Space” (B. Chazelle), Comput. Sci. Techn. Rep. No. CS-TR-155-88, Princeton University, 1988. Bernard Chazelle acknowledges the National Science Foundation for supporting this research in part under Grant CCR-8700917. Emo Welzl acknowledges the Deutsche Forschungsgemeinschaft for supporting this research in part under Grant We 1265/1-1.
Rights and permissions
About this article
Cite this article
Chazelle, B., Welzl, E. Quasi-optimal range searching in spaces of finite VC-dimension. Discrete Comput Geom 4, 467–489 (1989). https://doi.org/10.1007/BF02187743
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187743