HIGHLIGHTS
- who: James D. Anderson from the Wright State University, Dayton, OH, USA have published the research work: Delaunay walk for fast nearest neighbor: accelerating correspondence matching for ICP, in the Journal: (JOURNAL)
- what: The work has shown a nearly 90% speedup when compared to the traditional k-d tree as seen in Fig 1. The work presented in this paper allows searches to begin from any arbitrary point within the data set, allowing for extremely fast results when subsequent searches are similar to the previous ones. Since the structure of the work presented in this . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.