CGAL users discussion list

Hello,

I tried unsuccessfully to use the DelaunayD class.  I have a couple of 
questions :

1) DelaunayD class seems to be bugged in the current CGAL release. I have 
found no archive on that topic. Does there exists some ?

2) I have to compute Delaunay triangulations of N points in D dimensions. It 
seems that the overall complexity of DelaunayD class is O(N^{D/2}) to that 
purpose. Is it correct ? 

3) I need a better complexity, and I am currently trying to write down 
something. I am trying to explore a linear constrained programming based 
idea, in the CDD spirit, but I am not sure that this is the best thing to do. 
May I ask you for a recommandation in that direction ? 

Bests,

Jean-Marc