Subject: CGAL users discussion list
List archive
- From: GClaeys <>
- To:
- Subject: [cgal-discuss] Triangulation iterator: too many edges?
- Date: Tue, 21 Jun 2011 05:40:41 -0700 (PDT)
Hello,
I have a problem with iterating over all edges of a 3D mesh complex. I use
the finite_edges_iterator from the
CGAL::Mesh_complex_3_in_triangulation_3::Triangulation class, but this
iterator returns not only the internal edges but also edges outside the
tetrahedron mesh.
for (Triangulation::Finite_edges_iterator it = tr.finite_edges_begin(); it
!= tr.finite_edges_end(); ++it) {
start = it->first->vertex(it->second)->point();
end = it->first->vertex(it->third)->point();
//...
}
Is there a way to iterate over the internal edges only (those of the
tetrahedra)?
Thanks in advance
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Triangulation-iterator-too-many-edges-tp3613933p3613933.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] Triangulation iterator: too many edges?, GClaeys, 06/21/2011
- Re: [cgal-discuss] Triangulation iterator: too many edges?, Laurent Rineau (GeometryFactory), 06/21/2011
- [cgal-discuss] Re: Triangulation iterator: too many edges?, GClaeys, 06/21/2011
- Re: [cgal-discuss] Triangulation iterator: too many edges?, Laurent Rineau (GeometryFactory), 06/21/2011
Archive powered by MHonArc 2.6.16.