1. Divide-and-conquer in multidimensional space;Bentley;Proc. 8th Ann. ACM Symp. on Theory of Computing,1976
2. A sweepline algorithm for Voronoi diagrams;Fortune;Proc. 2nd Ann. ACM Symp. on Computational Geometry,1986
3. A note on Rabin's nearest-neighbor algorithm;Fortune;Inform. Process. Lett.,1979
4. Plane-sweep algorithms for intersecting geometric figures;Nievergelt;Comm. ACM,1982
5. Computational Geometry;Preparata,1985