CGAL users discussion list

["Karthik Palaniappan" <>]

Hi,

I'm a newbie to CGAL, so please excuse me if this is a question that has already been discussed in the past.

I have a point list (in 2-d).  I want to be able to do a k-nearest neighbor search and a range search (all points within a certain bounding box).

My questions are as follows:
*)  The examples show that the coordinates of the points matching the criterion can be returned.  Instead, can I just get the ID's (say index of the point in the original STL Vector/List)of the points.  This is necessary for the rest of my algorithm.
*)  All the examples assume that the list of points is already known a priori.  In my application, I will be adding points to my original list on the fly.  Can I add points to the kd_tree data structure after it has been initialized?

Thanks,
karthik