How to searching for in kdtree when dynamic elements are considered

[jsl n]

Hi,

   I'm using kdtree for searching for the closest point between two images.
The kdtree stores the points of one (fixed) of the two images and the second 
one is iteratively transformed (rotated, translated, etc). The closest point is
computed for each moved point each iteration. 

This is the procedure, but, what happen if the fixed image (the one that the 
kdtree stores) is also transformed each iteration? should I build a new kdtree 
each iteration? I need to know if there is an efficient solution for this dynamic 
situations where all the image points (of the fixed image) are transformed in 
the same way.

Thanks in advance.
 		 	   		  
_________________________________________________________________
Deja que Sietes te enseñe todo los secretos de Windows
http://www.sietesunpueblodeexpertos.com/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.alioth.debian.org/pipermail/libkdtree-devel/attachments/20091116/078a200f/attachment.htm>