✦ LIBER ✦

AnO(nlogn) algorithm for the all-nearest-neighbors Problem

✍ Scribed by Pravin M. Vaidya

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An all-round sweep algorithm for 2-dimen

✍ Klaus Hinrichs; Jurg Nievergelt; Peter Schorn 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 597 KB

The all nearest-neighbor problem for con

✍ D.T. Lee; F.P. Preparata 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 523 KB

Probabilistic analysis of an algorithm f

✍ Frank Bartling; Klaus Hinrichs 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 528 KB

Effective algorithms for the nearest nei

✍ Kazuo Hattori; Yasunobu Torii 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 494 KB

A note on the all nearest-neighbor probl

✍ C.C. Yang; D.T. Lee 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Weighted nearest neighbor algorithms for

✍ Yuichi Asahiro; Eiji Miyano; Shuichi Miyazaki; Takuro Yoshimuta 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 231 KB