✦ LIBER ✦

The all nearest-neighbor problem for convex polygons

✍ Scribed by D.T. Lee; F.P. Preparata

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the all nearest-neighbor probl

✍ C.C. Yang; D.T. Lee 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 178 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

An all-round sweep algorithm for 2-dimen

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

Deferred data structure for the nearest

✍ Alok Aggarwal; Prabhakar Raghavan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Extremal problems for convex polygons

✍ Charles Audet; Pierre Hansen; Frédéric Messine 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 501 KB