CGAL users discussion list

[Samuel Hornus <>]

Bernhard Kornberger 
<>
 wrote:
> Bernhard Kornberger schrieb:
> > However, in higher dimension the code crashes:
> > 
> > ./delaunay_d -n 100 -d 9
> > Starting Triangulation...
> > Triangulation for 100 points in dimension 9
> > Segmentation fault (core dumped)
> 
> Any suggestions?

Hello,
I've tried your example with latest CGAL.
It also crashes for d=9. I've no idea why, yet.
I'm working on a new Delaunay_d which takes less memory and
has exact predicates. It does not crash with 100 9D points;
however, I'm not sure, yet, it does actually compute a correct
Delaunay triangulation... :-) (In 2D the triangulation is correct).
Feel free to ask if you want to try it.
Sam.
On a Intel(R) Pentium(R) D CPU 3.00GHz:
$time ./dtd 9 100
        Inserting 100 9D vertices...
0 Mbytes used
0 Mbytes used
4 Mbytes used
14 Mbytes used
30 Mbytes used
50 Mbytes used
75 Mbytes used
111 Mbytes used
152 Mbytes used
194 Mbytes used

100 vertices and 961300 simplices.
469.207 seconds

real    7m50.070s
user    7m47.180s
sys     0m1.178s