Optimal Expected-Time Algorithms for Closest Point Problems

AHO A V HOPCROFT J.E. AND ULLMAN J.D The Design and Analysts of Computer Algorithms. Addison-Wesley Reading Mass 1974. AHO A V HOPCROFT J.E. AND ULLMAN J.D The Design and Analysts of Computer Algorithms. Addison-Wesley Reading Mass 1974.

10.1145/358841.358850

BENTLEY J L, 1978, IEEE Trans. Comput C-27, 2, 97, 10.1109/TC.1978.1675043

10.1145/356789.356797

CHERITON D, 1976, SIAM J. Comput., 5, 4, 10.1137/0205051

DOBKIN D, 1976, SIAM J. Comput, 5, 2, 10.1137/0205015

FORTUNE S., 1979, Inf. Process. Lett., 8, 1, 10.1016/0020-0190(79)90085-1

10.1145/355744.355745

KIRKPATRICK D G, 1979, Proc. 20th IEEE Syrup Foundatmns of Computer Sctence, 18

LIPTON R.J., 1977, Proc 18th IEEE Symp. Foundatmns of Computer Science, 162

MONIER L., 1978, Bentley

10.1145/359423.359430

RABIN M O, 1976, Academm Press, 21

ROHLF, 1978, Inf. Process. Lett., 7, 1, 10.1016/0020-0190(78)90028-5

SHAMOS M.I Computational geometry Ph.D. Dissertation Yale Umv. New Haven Conn. May 1978. SHAMOS M.I Computational geometry Ph.D. Dissertation Yale Umv. New Haven Conn. May 1978.

SHAMOS M.I, 1975, Foundatmns of Computer Scwnce, 151

WEIDE B.W., 1978, Carnegm- Mellon Umv

YAO A.C., 1975, Inf. Process. Lett., 4, 1, 10.1016/0020-0190(75)90050-2

YAO A C, 1977, Calif.

YUVAL G., 1976, Inf. Process. Lett, 5, 3, 10.1016/0020-0190(76)90064-8