CGAL users discussion list

[Kwok Jasper <>]

Thanks

I have used
typedef CGAL::Exact_predicates_inexact_constructions_kernel K1

before.

However, it takes nearly 1 hour to insert about 300000 points.
Therefore, I have switched from

Exact_predicates_inexact_constructions_kernel to Cartesian.

And except by using exact predicate,
may I ask if it still exist some other ways to prevent the stack overflow in version 3.3.1 of CGAL?

Thank you
> Date: Tue, 20 Jan 2009 11:16:04 +0100
> From:
> To:
> Subject: Re: [cgal-discuss]
>
> Kwok Jasper wrote:
> > Excuse me, may I ask something about 3D Delaunay triangulation in CGAL?
> >
> > I have tried to use the following types.
> >
> > typedef CGAL::Cartesian<double> K1;
> > typedef CGAL::Delaunay_triangulation_3<K1> Triangulation;
> > typedef Triangulation::Point Point_tr;
> >
> >
> > when I insert about 300000 points into the triangulation,
> > I got a stack overflow problem.
> >
> > May I ask what may be the possible reason for the stack overflow to occur?
> >
> >
> > ------------------------------------------------------------------------
>
> With Cartesian<double> anything can go on. In order to avoid
> floiting point arithmetic related problems you should use the
>
> typedef CGAL::Exact_predicates_inexact_constructions_kernel K1;
>
> andreas
>
>
>
>
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss

---

想同MSN Buddy傾計了解佢多d？ 參觀MSN Buddy部屋啦！