Discrete & Computational Geometry

, Volume 8, Issue 3, pp 315–334 | Cite as

Efficient partition trees

  • Jiří Matoušek


We prove a theorem on partitioning point sets inEd (d fixed) and give an efficient construction of partition trees based on it. This yields a simplex range searching structure with linear space,O(n logn) deterministic preprocessing time, andO(n1−1/d(logn)O(1)) query time. WithO(nlogn) preprocessing time, where δ is an arbitrary positive constant, a more complicated data structure yields query timeO(n1−1/d(log logn)O(1)). This attains the lower bounds due to Chazelle [C1] up to polylogarithmic factors, improving and simplifying previous results of Chazelleet al. [CSW].

The partition result implies that, forrdn1−δ, a (1/r)-approximation of sizeO(rd) with respect to simplices for ann-point set inEd can be computed inO(n logr) deterministic time. A (1/r)-cutting of sizeO(rd) for a collection ofn hyperplanes inEd can be computed inO(n logr) deterministic time, provided thatrn1/(2d−1).


Computational Geometry Query Time Partition Scheme Partition Tree Query Answering 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [A]
    P. K. Agarwal. Partitioning arrangements of lines, II: Applications.Discrete & Computational Geometry, 5:533–573, 1990.MathSciNetCrossRefzbMATHGoogle Scholar
  2. [AHT]
    A. Aggarwal, M. Hansen, and T. Leighton. Solving query-retrieval problems by compacting Voronoi diagrams. InProc. 21st ACM Symposium on Theory of Computing, pages 331–340, 1990.Google Scholar
  3. [AM1]
    P. K. Agarwal and J. Matoušek. Dynamic half-space range reporting and its applications. Tech. Report CS-91-43, Duke University, 1991. Extended abstract:Proc. 33rd IEEE Symposium on Foundations of Computer Science, to appear, 1992.Google Scholar
  4. [AM2]
    P. K. Agarwal and J. Matoušek. Ray shooting and parametric search. Tech. Report CS-1991-22, Duke University, 1991. Extended abstract:Proc. 24th ACM Symposium on Theory of Computing, 1992.Google Scholar
  5. [AS]
    P. K. Agarwal and M. Sharir. Applications of a new space partitioning scheme. InProc. 2nd Workshop on Algorithms and Data Structures, 1991.Google Scholar
  6. [B]
    J. L. Bentley. Decomposable searching problems.Information Processing Letters, 8:244–251, 1979.MathSciNetCrossRefzbMATHGoogle Scholar
  7. [CF]
    B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry.Combinatorica, 10(3):229–249, 1990.MathSciNetCrossRefzbMATHGoogle Scholar
  8. [CGL]
    B. Chazelle, L. Guibas, and D. T. Lee. The power of geometric duality.BIT, 25(1), 1985.Google Scholar
  9. [C1]
    B. Chazelle. Lower bounds on the complexity of polytope range searching.Journal of the American Mathematical Society, 2(4):637–666, 1989.MathSciNetCrossRefzbMATHGoogle Scholar
  10. [C2]
    B. Chazelle. Cutting hyperplanes for divide-and-conquer. Tech. Report CS-TR-335-91, Princeton University, 1991. Preliminary version:Proc. 32nd IEEE Conference on Foundations of Computer Science, October 1991. To appear inDiscrete & Computational Geometry.Google Scholar
  11. [CP]
    B. Chazelle and F. P. Preparata. Halfspace range searching: An algorithmic application ofk-sets.Discrete & Computational Geometry, 1:83–93, 1986.MathSciNetCrossRefzbMATHGoogle Scholar
  12. [CSW]
    B. Chazelle, M. Sharir, and E. Welzl. Quasi-optimal upper bounds for simplex range searching and new zone theorems. InProc. 6th ACM Symposium on Computational Geometry, pages 23–33, 1990.Google Scholar
  13. [CW]
    B. Chazelle and E. Welzl. Quasi-optimal range searching in spaces of finite VC-dimension.Discrete & Computational Geometry, 4:467–490, 1989.MathSciNetCrossRefzbMATHGoogle Scholar
  14. [E]
    H. Edelsbrunner.Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987CrossRefzbMATHGoogle Scholar
  15. [EW]
    H. Edelsbrunner and E. Welzl. Halpflanar range search in linear space andO(n 0.695) query time.Information Processing Letters, 23(6):289–293, 1986.CrossRefzbMATHGoogle Scholar
  16. [HW]
    D. Haussler and E. Welzl.ɛ-nets and simplex range queries.Discrete & Computational Geometry, 2:127–151, 1987.MathSciNetCrossRefzbMATHGoogle Scholar
  17. [M1]
    J. Matoušek. Approximations and optimal geometric divide-and-conquer. InProc. 23rd ACM Symposium on Theory of Computing, pages 506–511, 1991.Google Scholar
  18. [M2]
    J. Matoušek. Cutting hyperplane arrangements.Discrete & Computational Geometry, 6(5):385–406, 1991.MathSciNetCrossRefzbMATHGoogle Scholar
  19. [M3]
    J. Matoušek. Range searching with efficient hierarchical cuttings. InProc. 8th ACM Symposium on Computational Geometry, pages 276–285, 1992.Google Scholar
  20. [M4]
    J. Matoušek. Reporting points in halfspace. inProc. 32nd IEEE Symposium on Foundations of Computer Science, pages 207–215, 1991. Also to appear inComputational Geometry: Theory and Applications.Google Scholar
  21. [MWW]
    J. Matoušek, E. Welzl, and L. Wernisch. Discrepancy andɛ-approximations for bounded VC-dimension.Combinatorica, to appear. Also inProc. 32nd IEEE Symposium on Foundations of Computer Science, pages 424–430, 1991.Google Scholar
  22. [O]
    M. H. Overmars.The design of Dynamic Data Structures. Springer-Verlag, Berlin, 1983.zbMATHGoogle Scholar
  23. [SO]
    H. Schipper and M. H. Overmars. Dynamic partition trees. InProc. 2nd Scandavian Workshop on Algorithms Theory, pages 404–417, 1990. Lecture Notes in Computer Science, Vol. 447. Springer-Verlag, Berlin, 1990. Also to appear inBIT.Google Scholar
  24. [VC]
    V. N. Vapnik and A. Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities.Theory of Probability and its Applications, 16:264–280, 1971.CrossRefzbMATHGoogle Scholar
  25. [We]
    E. Welzl. Partition trees for triangle counting and other range searching problems. InProc. 4th ACM Symposium on Computational Geometry, pages 23–33, 1988.Google Scholar
  26. [Wi]
    D. E. Willard. Polygon retrieval.SIAM Journal on Computing, 11:149–165, 1982.MathSciNetCrossRefzbMATHGoogle Scholar
  27. [YY]
    F. F. Yao and A. C. Yao. A general approach to geometric queries. InProc. 17th ACM Symposium on Theory of Computing, pages 163–168, 1985.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1992

Authors and Affiliations

  • Jiří Matoušek
    • 1
  1. 1.Department of Applied MathematicsCharles UniversityPraha 1Czechoslovakia

Personalised recommendations