Document

# Unit-Disk Range Searching and Applications

## File

LIPIcs.SWAT.2022.32.pdf
• Filesize: 0.77 MB
• 17 pages

## Cite As

Haitao Wang. Unit-Disk Range Searching and Applications. In 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 227, pp. 32:1-32:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.SWAT.2022.32

## Abstract

Given a set P of n points in the plane, we consider the problem of computing the number of points of P in a query unit disk (i.e., all query disks have the same radius). We show that the main techniques for simplex range searching can be adapted to this problem. For example, by adapting Matoušek’s results, we can build a data structure of O(n) space so that each query can be answered in O(√n) time; alternatively, we can build a data structure of O(n²/log² n) space with O(log n) query time. Our techniques lead to improvements for several other classical problems in computational geometry. 1) Given a set of n unit disks and a set of n points in the plane, the batched unit-disk range counting problem is to compute for each disk the number of points in it. Previous work [Katz and Sharir, 1997] solved the problem in O(n^{4/3}log n) time. We give a new algorithm of O(n^{4/3}) time, which is optimal as it matches an Ω(n^{4/3})-time lower bound. For small χ, where χ is the number of pairs of unit disks that intersect, we further improve the algorithm to O(n^{2/3}χ^{1/3}+n^{1+δ}) time, for any δ > 0. 2) The above result immediately leads to an O(n^{4/3}) time optimal algorithm for counting the intersecting pairs of circles for a set of n unit circles in the plane. The previous best algorithms solve the problem in O(n^{4/3}log n) deterministic time [Katz and Sharir, 1997] or in O(n^{4/3}log^{2/3} n) expected time by a randomized algorithm [Agarwal, Pellegrini, and Sharir, 1993]. 3) Given a set P of n points in the plane and an integer k, the distance selection problem is to find the k-th smallest distance among all pairwise distances of P. The problem can be solved in O(n^{4/3}log² n) deterministic time [Katz and Sharir, 1997] or in O(nlog n+n^{2/3}k^{1/3}log^{5/3}n) expected time by a randomized algorithm [Chan, 2001]. Our new randomized algorithm runs in O(nlog n +n^{2/3}k^{1/3}log n) expected time. 4) Given a set P of n points in the plane, the discrete 2-center problem is to compute two smallest congruent disks whose centers are in P and whose union covers P. An O(n^{4/3}log⁵ n)-time algorithm was known [Agarwal, Sharir, and Welzl, 1998]. Our techniques yield a deterministic algorithm of O(n^{4/3}log^{10/3} n⋅ (log log n)^{O(1)}) time and a randomized algorithm of O(n^{4/3}log³ n⋅ (log log n)^{1/3}) expected time.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Computational geometry
• Theory of computation → Design and analysis of algorithms
##### Keywords
• Unit disks
• disk range searching
• batched range searching
• distance selection
• discrete 2-center
• arrangements
• cuttings

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Pankaj K. Agarwal. Range searching. In Handbook of Discrete and Computational Geometry, Csaba D. Tóth, Joseph O'Rourke, and Jacob E. Goodman (eds.), pages 1057-1092. CRC Press, 3rd edition, 2017.
2. Pankaj K. Agarwal. Simplex range searching and its variants: a review. In A Journey Through Discrete Mathematics, pages 1-30. Springer, 2017.
3. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, and Subhash Suri. Selecting distances in the plane. Algorithmica, 9:495-514, 1993.
4. Pankaj K. Agarwal and Jiří Matoušek. On range searching with semialgebraic sets. Discrete and Computational Geometry, 11:393-418, 1994.
5. Pankaj K. Agarwal, Jiří Matoušek, and Micha Sharir. On range searching with semialgebraic sets. II. SIAM Journal on Computing, 42:2039-2062, 2013.
6. Pankaj K. Agarwal, Marco Pellegrini, and Micha Sharir. Counting circular arc intersections. SIAM Journal on Computing, 22:778-793, 1993.
7. Pankaj K. Agarwal and Micha Sharir. Pseudoline arrangements: Duality, algorithms, and applications. SIAM Journal on Computing, 34:526-552, 2005.
8. Pankaj K. Agarwal, Micha Sharir, and Emo Welzl. The discrete 2-center problem. Discrete and Computational Geometry, 20:287-305, 1998.
9. Jon L. Bentley and Hermann A. Maurer. A note on Euclidean near neighbor searching in the plane. Information Processing Letters, 8:133-136, 1979.
10. Timothy M. Chan. On enumerating and selecting distances. International Journal of Computational Geometry and Application, 11:291-304, 2001.
11. Timothy M. Chan. Optimal partition trees. Discrete and Computational Geometry, 47:661-690, 2012.
12. Timothy M. Chan and Konstantinos Tsakalidis. Optimal deterministic algorithms for 2-d and 3-d shallow cuttings. Discrete and Computational Geometry, 56:866-881, 2016.
13. Timothy M. Chan and Da Wei Zheng. Hopcroft’s problem, log-star shaving, 2D fractional cascading, and decision trees. In Proceedings of the 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 190-210, 2022.
14. Bernard Chazelle. An improved algorithm for the fixed-radius neighbor problem. Information Processing Letters, 16:193-198, 1983.
15. Bernard Chazelle. New techniques for computing order statistics in Euclidean space. In Proceedings of the 1st Annual Symposium on Computational Geometry (SoCG), pages 125-134, 1985.
16. Bernard Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete and Computational Geometry, 9(2):145-158, 1993.
17. Bernard Chazelle, Richard Cole, Franco P. Preparata, and Chee-Keng Yap. New upper bounds for neighbor searching. Information and Control, 68:105-124, 1986.
18. Bernard Chazelle and Herbert Edelsbrunner. Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation, 1:47-56, 1985.
19. Bernard Chazelle and Emo Welzl. Quasi-optimal range searching in spaces of finite VC-dimension. Discrete and Computational Geometry, 4(5):467-489, 1989.
20. Herbert Edelsbrunner. Algorithmis in Combinatorial Geometry. Heidelberg, 1987.
21. Jeff Erickson. New lower bounds for Hopcroft’s problem. Discrete and Computational Geometry, 16:389-418, 1996.
22. Michael T. Goodrich. Geometric partitioning made easier, even in parallel. In Proceedings of the 9th Annual Symposium on Computational Geometry (SoCG), pages 73-82, 1993.
23. John Hershberger and Subhash Suri. Finding tailored partitions. Journal of Algorithms, 3:431-463, 1991.
24. Matthew J. Katz and Micha Sharir. An expander-based approach to geometric optimization. SIAM Journal on Computing, 26(5):1384-1408, 1997.
25. Jiří Matoušek. Cutting hyperplane arrangement. Discrete and Computational Geometry, 6:385-406, 1991.
26. Jiří Matoušek. Efficient partition trees. Discrete and Computational Geometry, 8(3):315-334, 1992.
27. Jiří Matoušek. Range searching with efficient hierarchical cuttings. Discrete and Computational Geometry, 10(1):157-182, 1993.
28. Jiří Matoušek. Geometric range searching. ACM Computing Survey, 26:421-461, 1994.
29. Jiří Matoušek and Zuzana Patáková. Multilevel polynomial partitions and simplified range searching. Discrete and Computational Geometry, 54:22-41, 2015.
30. Micha Sharir. Computational geometry column 65. SIGACT News, 48:68-85, 2017.
31. Haitao Wang. On the planar two-center problem and circular hulls. In Proceedings of the 36th International Symposium on Computational Geometry (SoCG), pages 68:1-68:14, 2020.
32. Frances F. 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.