CGAL users discussion list

["John Yamokoski" <>]

Greetings,

I am trying to write a flexible library for d-dimension nearest neighbor searching and I have found the manual quite helpful - particularly example 35.3.5. But what I would really desire is for my point class to be template based. So instead of fixed to 3, 4, or 5 dimensions it would be something like this:

template<unsigned size_t>
struct Point {
  double _vec[size_t];

  Point()
  Point(double* vec) { for (unsigned ii=0; ii < size_t; ++ii) _vec[ii] = vec[ii]; }
 

  ... [rest of class] ...
}; //end of class

I have only briefly thought about the changes that would be required to example 35.3.5 to accommodate this change. But I wanted to get some input from those more experienced with CGAL - is this a pretty reasonable change or is there something I am missing that would make this difficult.

J.D. Yamokoski