34 search results - page 1 / 7 » Approximate K-D Tree Search for Efficient ICP |
3DIM
2003
IEEE
13 years 8 months ago
2003
IEEE
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
ICMCS
2006
IEEE
13 years 10 months ago
2006
IEEE
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
EGH
2010
Springer
13 years 2 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
3DIM
2007
IEEE
13 years 11 months ago
2007
IEEE
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
WABI
2009
Springer
13 years 11 months ago
2009
Springer
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...