Dynamic algorithms for half-space reporting, proximity problems, and geometric minimum spanning trees

Pankaj Kumar Agarwal, David Eppstein, and Jiř Matoušek
Proc. 33rd Symp. Foundations of Computer Science, IEEE, Oct 1992, pp. 80–89
http://www.ics.uci.edu/~eppstein/pubs/AgaEppMat-FOCS-92.pdf

Cited by:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!