1.

J. L. Bentley and H. A. Maurer, A note on Euclidean near neighbor searching in the plane, Inform. Process. Lett. 8 (1979), 133–136.

MATHMathSciNetCrossRef2.

B. Chazelle, Filtering search: A new approach to query-answering, Proc. 24th IEEE Annu. Symp. Found. Comput. Sci., (1983), 122–132 (also to appear in J. SIAM on Comput.)

3.

B. Chazelle, Criticality considerations in the design of geometric algorithms, Proc. 22nd Annu. Allerton Conf. on Comm., Contr., and Comput. (1984).

4.

B. Chazelle, R. Cole, F. P. Preparata, and C. K. Yap, New upper bounds for neighbor searching, Tech. Rept. CS-84-11 (1984), Brown Univ.

5.

B. Chazelle, L. J. Guibas, and D. T. Lee, The power of geometric duality, Proc. 24th IEEE Annu. Symp. Found. Comput. Sci., (1983), 217–225.

6.

R. Cole, M. Sharir, and C. K. Yap, On*k*-hulls and related problems, Proc. 16th Annu. ACM Symp. on Theory of Computing, (1984), 154–166. To appear in SIAM J. on Comput.

7.

R. Cole and C. K. Yap, Geometric retrieval problems, Proc. 24th IEEE Annu. Symp. Found. Comput. Sci., (1983), 112–121.

8.

H. Edelsbrunner, Arrangements and geometric computations, to appear.

9.

H. Edelsbrunner, J. O'Rourke, and R. Seidel, Constructing arrangements of lines and hyperplanes with applications, Proc. 24th IEEE Annu. Symp. Found. Comput. Sci., (1983), 83–91.

10.

P. Erdős, L. Lovász, A. Simmons, and E. G. Straus, Dissection graphs of planar point sets, in A Survey of Combinatorial Theory, J. N. Srivastava et al., eds., North-Holland (1973), 139–149.

11.

D. T. Lee, On

*k*-nearest neighbor Voronoi diagrams in the plane, IEEE Trans. Comp., Vol C-31, No. 6, June 1982, pp. 478–487.

CrossRefMATH12.

F. P. Preparata and M. I. Shamos, Introduction to Computational Geometry, Springer-Verlag, to appear.

13.

F. F. Yao, D. P. Dobkin, and H. Edelsbrunner, A partition of 3-space with applications, forthcoming report.