CGAL users discussion list

["developer" <>]

I am attempting to use the dD spatial searching module using the example code 
in section 3.6.3 (v4.8) as a starting point:
http://doc.cgal.org/latest/Spatial_searching/Spatial_searching_2searching_with_point_with_info_pmap_8cpp-example.html

The data set I'm working with has point ID's (the map key) that do not start 
at zero and are not continuous. However the K_neighbor_search function 
outputs incorrect results for a std::map with integer keys that non 
continuous and/or do not start at zero.

How can I use arbitrary integer keys with the K_neighbor_search function? Is 
the only way to create two maps, one with continuous keys for use in the 
K_neighbor_search and a second to act as a lookup table for the actual point 
ID's?

Thanks,
Michael