CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Everything works fine here. Does it crashes at every run?
If no it would help to get the random seed.

Have you tried to run it without the info
(using the insert by range without the info)?

what is your platform?

Sebastien.

On 12/19/2013 10:57 PM, Dmitriy Morozov wrote:
> Hi,
>
> I'm trying to construct a Delaunay triangulation where each vertex
> stores its own index. I copied the example from the CGAL documentation,
> except I've increased the number of points from 6 to 10^6. The code
> (attached) segfaults with CGAL 4.3 during the spatial sort (I insert the
> range of points in the constructor). I can work around the problem by
> inserting points one by one, but that, of course, sacrifices efficiency.
>
> Does anyone have any idea what's going on and whether I could somehow
> fix this?
>
> Thanks.
> Dmitriy