✦ LIBER ✦

A note on the all nearest-neighbor problem for convex polygons

✍ Scribed by C.C. Yang; D.T. Lee

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The all nearest-neighbor problem for con

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

AnO(nlogn) algorithm for the all-nearest

✍ Pravin M. Vaidya 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 925 KB

A linear time algorithm for finding all

✍ Alok Aggarwal; Dina Kravets 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 416 KB

A NOTE ON THE DERIVATION OF NEAREST NEIG

✍ Michael F. Dacey 📂 Article 📅 1960 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

On the nearest neighbor rule for the tra

✍ Cor A.J. Hurkens; Gerhard J. Woeginger 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 227 KB

Weighted nearest neighbor algorithms for

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