CGAL users discussion list

[Andreas Fabri <>]

Your code looks ok, and your machine has as much RAM as mine.

I guess you have to come up with a minimal code example
so that we can give it a try.

andreas


Kwok Jasper wrote:
> Thank you
> 
> The code I am using is as follows
> 
> 
> typedef CGAL::Delaunay_triangulation_3<K1> Triangulations;
> typedef Triangulations::Point Point_tr;
> typedef Triangulations::Facet Facet;
> typedef Triangulations::Finite_facets_iterator finite_facets_itr;
> typedef Triangulations::Triangle Triangle;
> 
>     list<finite_facets_itr> temp;
>     Triangle temp_triangle;
>     double temp_circumradius = 0;
>     double temp_max_inter_vertice_dist;
> 
>     finite_facets_itr starting_facet = Tr.finite_facets_begin();
>     finite_facets_itr ending_facet = Tr.finite_facets_end();
>     finite_facets_itr current_facet = starting_facet;
> 
>     for(current_facet = starting_facet; current_facet != ending_facet; 
> ++current_facet)
>     {
>           temp_triangle = Tr.tri angle(*current_facet);
> 
>           if ( .......)
>           {
>                temp.push_back(current_facet);
>           }
>     }
> 
> 
> And I have attached in this email about the configuration of the machine 
> I am using.
> 
> Thank you very much
> 
> 
> 
>  > Date: Mon, 2 Feb 2009 15:09:11 +0100
>  > From: 
> 
>  > To: 
> 
>  > Subject: Re: [cgal-discuss] advice about CGAL Delaunay Triangulation
>  >
>  >
>  > Jasper,
>  >
>  > The limitation of the std::list should be the virtual memory.
>  >
>  > Concerning the Finite_faces_iterator, are you sure not
>  > to forget to increment the iterator?
>  >
>  > Can you send us the code of your loop.
>  >
>  >
>  > < br>> I would be glad to know the configuration of your machine.
>  >
>  > As you are on Windows, could you go to Start -> Control Panel -> System
>  > and then tell us what is written in the tab 'General".
>  >
>  > On my machine I see
>  >
>  > System:
>  > Microsoft Windows XP
>  > ...
>  >
>  > Registered to:
>  > ...
>  >
>  > Computer:
>  > AMD Turion
>  > ML 40
>  > 2.19 GHz, 896 MB of RAM.
>  >
>  >
>  > What is written there on your computer?
>  >
>  > andreas
>  >
>  >
>  >
>  > Kwok Jasper wrote:
>  > > 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> Triangulat ions;
>  > >
>  > >
>  > > 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™卓越功能 收發郵件以外更多功能
>  > > <http://www.microsoft.com/windows/windowslive/>
>  >
>  > --
>  > You are currently subscribed to cgal-discuss.
>  > To unsubscribe or access the archives, go to
>  > https://lists-sop.inria.fr/wws/info/cgal-discuss
> 
> ------------------------------------------------------------------------
> 收發郵件以外 - 了解更多Windows Live™卓越功能 收發郵件以外更多功能 
> <http://www.microsoft.com/windows/windowslive/>
> ------------------------------------------------------------------------
>