✦ LIBER ✦

Optimal bucket size for nearest neighbor searching in k-d trees

✍ Scribed by C.M. Eastman

Book ID: 113162357
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 287 KB
Volume: 12
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(81)90092-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partially specified nearest neighbor sea

Partially specified nearest neighbor searches using k-d trees

✍ C.M. Eastman; M. Zemankova 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 527 KB

The efficiency of using k-d trees for fi

The efficiency of using k-d trees for finding nearest neighbors in discrete space

✍ O.J. Murphy; S.M. Selkow 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 252 KB

A Road Network Embedding Technique for K

A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases

✍ Cyrus Shahabi; Mohammad R. Kolahdouzan; Mehdi Sharifzadeh 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 601 KB

Optimal choice of discriminators in a ba

Optimal choice of discriminators in a balanced k-d binary search tree

✍ Ysmar V. Silva Filho 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 448 KB

Amer. inst. chem. eng. j.: Pho, T. K. an

Amer. inst. chem. eng. j.: Pho, T. K. and Lapidus, L. ‘Topics in c.a.d. Part. An optimum tearing algorithm for recycle systems’ Part 2. Synthesis of optimal heat exchanger networks by tree searching algorithms’ Vol 19, No 6 (November 1973) pp 1170–1189

📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 116 KB

The SAR70 program has been written as a tool within the SAR design method for supports. A support is a building in which a variety of floorplans for dwellings can hc made. The design method allows evaluation of such asupport. SAR7O can be used to generate all variations possible within a support str