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

Baruch Schieber, Uzi Vishkin

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Fingerprint Dive into the research topics of 'Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science