Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] How to navigate Outputiterator for inicident_edges?

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] How to navigate Outputiterator for inicident_edges?


Chronological Thread 
  • From: Manuel Caroli <>
  • To:
  • Subject: Re: [cgal-discuss] How to navigate Outputiterator for inicident_edges?
  • Date: Fri, 09 Oct 2009 10:43:30 +0200

Dear Suejung,


wrote:
[...]

int main()
{
Delaunay T;

std::ifstream in("data/voronoi.cin");

Point p;
while(in >> p){
T.insert(p);
}



cout << "All Cells ----------------------------\n";
Cell_iterator cit =T.cells_begin();
for ( ; cit !=T.cells_end(); ++cit) {
if (! T.is_infinite(cit)) continue;
note that there is a Finite_cells_iterator that does this automatically

// T.incident_edges(cit) ?????? <<--- Want to find edges!!!
I am not sure to understand what you want to do. What do you mean by edges incident to a cell? These are the edges of the cell that you can extract immediately. There is a function incident_edges that gives you the edges incident to a *vertex*. In this case you have to provide it with an output iterator as second argument.

To understand the internal representation of a triangulation please read chapter 35.1 of the user manual (of CGAL 3.6): http://www.cgal.org/Manual/last/doc_html/cgal_manual/Triangulation_3/Chapter_main.html
For the available access functions see the reference documentation: http://www.cgal.org/Manual/last/doc_html/cgal_manual/Triangulation_3_ref/Class_Triangulation_3.html

hope this helps

Manuel


}

return 0;
}




Archive powered by MHonArc 2.6.16.

Top of Page