Finding all nearest neighbors for convex polygons in parallel — a new lower bound technique and a matching algorithm

Baruch Schieber and Uzi Vishkin
Discrete Applied Mathematics 29:97–111, 1990

Cites:

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