Lazy algorithms for dynamic closest pair with arbitrary distance measures

Jean Cardinal and David Eppstein
Joint Proc. Worksh. Algorithm Engineering and Experiments (ALENEX) and Worksh. Analytic Algorithmics and Combinatorics (ANALCO), ACM and SIAM, 2004, pp. 112–119
Tech. report 502, Univ. Libre de Bruxelles, Computer Science Dept., 2003

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