Document Open Access Logo

A Deterministic Partition Tree and Applications

Author Haitao Wang

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ESA.2025.114.pdf
  • Filesize: 0.74 MB
  • 17 pages
HTML5 Logo HTML (experimental)
LIPIcs.ESA.2025.114.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
  • Theory of computation → Design and analysis of algorithms
Keywords
  • partition trees
  • simplex range searching
  • segment intersection queries
  • ray-shootings
  • multi-level data structures

Metrics

Abstract

In this paper, we present a deterministic variant of Chan’s randomized partition tree [Discret. Comput. Geom., 2012]. This result leads to numerous applications. In particular, for d-dimensional simplex range counting (for any constant d ≥ 2), we construct a data structure using O(n) space and O(n^{1+ε}) preprocessing time, such that each query can be answered in o(n^{1-1/d}) time (specifically, O(n^{1-1/d} / log^Ω(1) n) time), thereby breaking an Ω(n^{1-1/d}) lower bound known for the semigroup setting. Notably, our approach does not rely on any bit-packing techniques. We also obtain deterministic improvements for several other classical problems, including simplex range stabbing counting and reporting, segment intersection detection, counting and reporting, ray-shooting among segments, and more. Similar to Chan’s original randomized partition tree, we expect that additional applications will emerge in the future, especially in situations where deterministic results are preferred.

Cite As Get BibTex

Haitao Wang. A Deterministic Partition Tree and Applications. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 114:1-114:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ESA.2025.114

Author Details

Haitao Wang
  • Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA

Acknowledgements

We would like to thank Timothy Chan for the discussions on derandomizing his partition tree.

References

  1. Pankaj K. Agarwal. Range searching, in Handbook of Discrete and Computational Geometry, C.D. Tóth, J. O'Rourke, and J.E. Goodman (eds.), pages 1057-1092. CRC Press, 3rd edition, 2017. Google Scholar
  2. Pankaj K. Agarwal. Simplex range searching and its variants: a review. In A Journey Through Discrete Mathematics, pages 1-30. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-44479-6_1.
  3. Pankaj K. Agarwal and Jiří Matoušek. Ray shooting and parametric search. SIAM Journal on Computing, 22(4):794-806, 1993. URL: https://doi.org/10.1137/0222051.
  4. Pankaj K. Agarwal and Micha Sharir. Applications of a new space-partitioning technique. Discrete and Computational Geometry, 9:11-38, 1993. URL: https://doi.org/10.1007/BF02189304.
  5. Pankaj K. Agarwal and Micha Sharir. Pseudoline arrangements: Duality, algorithms, and applications. SIAM Journal on Computing, 34:526-552, 2005. URL: https://doi.org/10.1137/S0097539703433900.
  6. Reuven Bar-Yehuda and Sergio Fogel. Variations on ray shootings. Algorithmica, 11:133-145, 1994. URL: https://doi.org/10.1007/BF01182772.
  7. Timothy M. Chan. Optimal partition trees. Discrete and Computational Geometry, 47:661-690, 2012. URL: https://doi.org/10.1145/1810959.1810961.
  8. Timothy M. Chan and Da Wei Zheng. Hopcroft’s problem, log-star shaving, 2D fractional cascading, and decision trees. ACM Transactions on Algorithms, 2023. URL: https://doi.org/10.1145/3591357.
  9. Timothy M. Chan and Da Wei Zheng. Simplex range searching revisited: How to shave logs in multi-level data structures. In Proceedings of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1493-1511, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch54.
  10. Bernard Chazelle. Lower bounds on the complexity of polytope range searching. Journal of the American Mathematical Society, 2(4):637-666, 1989. URL: https://doi.org/10.2307/1990891.
  11. Bernard Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete and Computational Geometry, 9(2):145-158, 1993. URL: https://doi.org/10.1007/BF02189314.
  12. Siu Wing Cheng and Ravi Janardan. Algorithms for ray-shooting and intersection searching. Journal of Algorithms, 13:670-692, 1992. URL: https://doi.org/10.1016/0196-6774(92)90062-H.
  13. Herbert Edelsbrunner, J. O'Rourke, and Raimund Seidel. Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing, 15:341-363, 1986. URL: https://doi.org/10.1137/0215024.
  14. Herbert Edelsbrunner and Emo Welzl. Halfplanar range search in linear space and O(n^0.695) query time. Information Processing Letters, 23:289-293, 1986. URL: https://doi.org/10.1016/0020-0190(86)90088-8.
  15. Leonidas J. Guibas, Mark H. Overmars, and Micha Sharir. Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques. In Proceedings of the 1st Scandinavian Workshop on Algorithm Theory (SWAT), pages 64-73, 1988. URL: https://doi.org/10.1007/3-540-19487-8_7.
  16. David Haussler and Emo Welzl. ε-nets and simplex range queries. Discrete and Computational Geometry, 2:127-151, 1987. URL: https://doi.org/10.1007/BF02187876.
  17. Jiří Matoušek. Efficient partition trees. Discrete and Computational Geometry, 8(3):315-334, 1992. URL: https://doi.org/10.1007/BF02293051.
  18. Jiří Matoušek. Range searching with efficient hierarchical cuttings. Discrete and Computational Geometry, 10(1):157-182, 1993. URL: https://doi.org/10.1007/BF02573972.
  19. Jiří Matoušek. Geometric range searching. ACM Computing Survey, 26:421-461, 1994. URL: https://doi.org/10.1145/197405.197408.
  20. Mark H. Overmars, Haijo Schipper, and Micha Sharir. Storing line segments in partition trees. BIT Numerical Mathematics, 30:385-403, 1990. URL: https://doi.org/10.1007/BF01931656.
  21. Haitao Wang. Unit-disk range searching and applications. Journal of Computational Geometry, 14:343-394, 2023. URL: https://doi.org/10.20382/jocg.v14i1a13.
  22. Haitao Wang. Algorithms for subpath convex hull queries and ray-shooting among segments. SIAM Journal on Computing, 53:1132-1161, 2024. URL: https://doi.org/10.1137/21M145118X.
  23. Dan E. Willard. Polygon retrieval. SIAM Journal on Computing, 11:149-165, 1982. URL: https://doi.org/10.1137/0211012.
  24. F. Frances Yao. A 3-space partition and its applications. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC), pages 258-263, 1983. URL: https://doi.org/10.1145/800061.808755.
  25. F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, and Mike Paterson. Partitioning space for range queries. SIAM Journal on Computing, 18:371-384, 1989. URL: https://doi.org/10.1137/0218025.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact