For my PhD work, I need to construct the Delaunay triangulation of a given point set in any (low) dimension. So far, I have been using the C++ CGAL library with data up to 4D without any noticeable problem.
However, as I used the same class CGAL::Delaunay_d as I previously used, on an 7D data set (namely UCI repository Seeds data set), it seems like something is going wrong and I don't know how to trace my problem.
The dataset is composed of 210 points and my code stops at the insertion of the 103-rd point (DT.insert() function of the class). A segmentation fault message is displayed as my program stops. It seems like the triangulation is well constructed (I checked the size of the triangulation as along with the insertion of points in the DT) until a problem occurs at this 103-rd point. At this stage of execution, the DT is composed of 63073 simplices.
I suspect an internal issue of the insert() function or the fact that I used no exact numberical types for computation.
Has anyone a clue to investigate my problem ?
Thanks in advance,
Octavio