When using KDtrees, I know we can store additional data along with the CGAL shape using search traits, e.g.,
typedef Kernel::Point_3 Point; typedef boost::tuple&l