References
- S.P.A. Alewijnse, T.M. Bagautdinov, M. de Berg, Q.W. Bouts, A.P. ten Brink, K. Buchin, M.A. Westenberg, Progressive geometric algorithms, Proceedings of the Thirtieth Annual Symposium on Computational Geometry, SOCG'14, ACM, Tokyo, Japan, 2014, pp. 50:50–50:59.
- M. Ben-Or, Lower bounds for algebraic computation trees, Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Portland Oregon, USA, 1983, pp. 80–86.
- J.L. Bentley, Multidimensional divide-and-conquer, Commun. ACM 23(4) (1980), pp. 214–229.
- P.B. Callahan and S.R. Kosaraju, A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields, J. ACM 42(1) (1995), pp. 67–90.
- S. Har-Peled, Geometric Approximation Algorithms, Vol. 173, American Mathematical Society, Providence, 2011.
- K. Hinrichs, J. Nievergelt, and P. Schorn, Plane-sweep solves the closest pair problem elegantly, Inform. Process. Lett. 26(5) (1988), pp. 255–261.
- S. Khuller and Y. Matias, A simple randomized sieve algorithm for the closest-pair problem, Inform. Comput. 118(1) (1995), pp. 34–37.
- J.M. Kleinberg, Two algorithms for nearest-neighbor search in high dimensions, STOC, Vol. 97, El Paso, Texas, USA,1997, pp. 599–608.
- A. Mesrikhani, M. Farshi, M. Davoodi, Progressive algorithm for Euclidean minimum spanning tree, 1st Iranian Conference on Computational Geometry, Tehran, Iran, 2018.
- A. Mesrikhani, M. Farshi, Solving the convex hull problem progressively in the external memory model, 2nd Iranian Conference on Computational Geometry, Tehran, Iran, 2019.
- A. Mesrikhani, M. Farshi, Progressive sorting in the external memory model, CSI J. Comput. Sci. Eng. 15(2), pp. 1-4.
- M.O. Rabin, Probabilistic algorithms in finite fields, SIAM J. Comput. 9(2) (1980), pp. 273–280.
- M. Shamos, Geometric complexity, Proceedings of the 16th Annual IEEE Symposium on the Foundation of Computer Science, Albuquerque, NM, USA, 1975, pp. 151–162.
- A. Yao, Lower bounds for algebraic computation trees with integer inputs, SIAM J. Comput. 20(4) (1991), pp. 655–668.
- Y. Zhou, H. Yu, An efficient comparison-based deterministic algorithm to solve the closest pair problem, 2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA), IEEE, Nanchang, China, 2015, pp. 145–148.