✦ LIBER ✦

Grid interpolation algorithm based on nearest neighbor fast search

✍ Scribed by Huang, Hao; Cui, Can; Cheng, Liang; Liu, Qiang; Wang, Jiechen

Book ID: 118823351
Publisher: Springer-Verlag
Year: 2012
Tongue: English
Weight: 437 KB
Volume: 5
Category: Article
ISSN: 1865-0473
DOI: 10.1007/s12145-012-0106-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast nearest-neighbor search algorithms

Fast nearest-neighbor search algorithms based on approximation-elimination search

✍ V. Ramasubramanian; Kuldip K. Paliwal 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 272 KB

In this paper, we provide an overview of fast nearest-neighbor search algorithms based on an &approxima-tion}elimination' framework under a class of elimination rules, namely, partial distance elimination, hypercube elimination and absolute-error-inequality elimination derived from approximations of

Nearest neighbor search algorithm based

Nearest neighbor search algorithm based on multiple background grids for fluid simulation

✍ De-qun Zheng; Pin Wu; Wei-lie Shang; Xiao-peng Cao 📂 Article 📅 2011 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 519 KB

A fast nearest-neighbor algorithm based

A fast nearest-neighbor algorithm based on a principal axis search tree

✍ McNames, J. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 627 KB

A fast nearest neighbor search algorithm

A fast nearest neighbor search algorithm by filtration

✍ Sung-Hyuk Cha; Sargur N. Srihari 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is "nding its nearest neighbors in a reference set. It would be very time consuming if computed feature by feature for all templates in the reference set; this namK ve method is O(nd) where n is the num

Fast multidimensional nearest neighbor s

Fast multidimensional nearest neighbor search algorithm using priority queue

✍ Shiro Ajioka; Satoru Tsuge; Masami Shishibori; Kenji Kita 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB

Voronoi Projection-Based Fast Nearest-Ne

Voronoi Projection-Based Fast Nearest-Neighbor Search Algorithms: Box-Search and Mapping Table-Based Search Techniques

✍ V. Ramasubramanian; K.K. Paliwal 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 334 KB

In this paper we consider fast nearest-neighbor search techniques based on the projections of Voronoi regions. The Voronoi diagram of a given set of points provides an implicit geometric interpretation of nearest-neighbor search and serves as an important basis for several proximity search algorithm