Publisher
Springer Nature Switzerland
Reference16 articles.
1. Bespamyatnikh, S.: An optimal algorithm for closest-pair maintenance. Discrete Comput. Geom. 19(2), 175–195 (1998). https://doi.org/10.1007/PL00009340
2. Daescu, O., Teo, K.: 2D closest pair problem: a closer look. In: CCCG 2017–29th Canadian Conference on Computational Geometry, Proceedings, pp. 185–190 (2017)
3. Daescu, O., Teo, K.: Two-dimensional closest pair problem: a closer look. Discrete Appl. Math. 287, 85–96 (2020). https://doi.org/10.1016/j.dam.2020.08.006
4. Golin, M.: Randomized data structures for the dynamic closest-pair problem. SIAM J. Comput. 27(4), 1036–1072 (1998). https://doi.org/10.1137/S0097539794277718
5. Kamousi, P., Chan, T., Suri, S.: Closest pair and the post office problem for stochastic points. Comput. Geom. Theory Appl. 47(2 PART B), 214–223 (2014). https://doi.org/10.1016/j.comgeo.2012.10.010