<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=Content-Type content="text/html; charset=windows-1255">
<META content="MSHTML 6.00.2737.800" name=GENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=#ffffff>
<DIV><FONT face=Arial size=2>Hello All!</FONT></DIV>
<DIV><FONT face=Arial size=2>I'm trying to develop registartion system using
vtk. i found the vtkitertiveclosestpointtransform as implementation of icp
algorithm. but to acclert the algorithm i want to use k-d-tree.</FONT></DIV>
<DIV><FONT face=Arial size=2>a. i found that someone develop k-d-tree for vtk
5.0. can someone send me that code?</FONT></DIV>
<DIV><FONT face=Arial size=2>b. i'm not sure about using the
vkitertiveclosestpointtransform well. can someone send me c++ code
example?</FONT></DIV>
<DIV><FONT face=Arial size=2></FONT> </DIV>
<DIV><FONT face=Arial size=2>thanks to all</FONT></DIV>
<DIV><FONT face=Arial size=2>moti</FONT></DIV></BODY></HTML>