CGAL users discussion list

[Kwok Jasper <>]

Excuse me, may I seek for some advise about using the Delaunay Triangulation?

If I have the Delaunay Triangulation declared as follows


typedef CGAL::Exact_predicates_inexact_constructions_kernel K1;
typedef CGAL::Delaunay_triangulation_3<K1> Triangulations;


After I have inserted several ten thousand points into the triangulation, I use the Finite_facets_iterator to iterate over all of the triangular faces in the triangulation.
For each of the triangular face, I check for some condition and if they satify the condition, I push then into a std::list<Finite_facets_iterator>

However, when I use the std::list<Finite_facets_iterator> to store all those triangular face, I get the exception saying that memory for the program is used up.
May I ask if it is that for huge number of points inserted into the Delaunay Triangulation, it is not recommended to use std::list or std::vector to store the above information?

If it is not recommended, what structure may I use for the storage.

Thank you very much.

---

收發郵件以外 - 了解更多Windows Live™卓越功能 收發郵件以外更多功能