CGAL users discussion list

Dear Andreas,

Thank you for your answer.
As far as I know, delaunay_dd-runtime.cpp requires LEDA, a non free software 
supported by algorithmic-solutions. Is there a way to test your solution 
without charge ?

Yours,

Jean-Marc




>Dear Jean-Marc,

In contrast to the 2D and 3D Delaunay triangulation you must use an exact 
number type.
Example code can be found in demo/Convex_hull_d//delaunay_dd-runtime.cpp

Note however that this makes it even slower. Currently no filtering approach 
(interval
arithmetic combined with exact rithmetic as last resort) is offered to get it 
faster.
We had one user who didn't use the dD points but wrote his own 4D points, 
which reduced
lots of overhead.

best regards,

andreas