Subject: CGAL users discussion list
List archive
- From: sgdimitris <>
- To:
- Subject: [cgal-discuss] Take the triangles of a polyhedron
- Date: Fri, 9 Mar 2012 10:34:06 -0800 (PST)
Hello,
I have a list of 3D points and I used the quickhull example from the folder
"CGAL-3.9\examples\Convex_hull_3"
to calculate their convex hull. I used the following code to take the list
of vertices and edges of convex hull
"
Polyhedron_3 poly;
// compute convex hull of non-collinear points
CGAL::convex_hull_3(points.begin(), points.end(), poly);
std::cout << "The convex hull contains " << poly.size_of_vertices() << "
vertices" << std::endl;
for ( Vertex_iterator v = poly.vertices_begin(); v != poly.vertices_end();
++v)
std::cout << v->point() << std::endl;
for ( Edge_iterator w = poly.edges_begin(); w != poly.edges_end(); ++w)
{
std::cout << "First Vertex of the edge" <<
w->opposite()->vertex()->point().x() << std::endl;
std::cout << "Second Vertex of the edge" << w->vertex()->point() <<
std::endl;
}
"
I need to take the *triangles that connect the vertices of the polyhedron*.
Is any way to do that?
Any help would be appreciated.
Regards,
Dimitris
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Take-the-triangles-of-a-polyhedron-tp4460275p4460275.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] Take the triangles of a polyhedron, sgdimitris, 03/09/2012
- Re: [cgal-discuss] Take the triangles of a polyhedron, Philipp Moeller, 03/09/2012
- [cgal-discuss] Re: Take the triangles of a polyhedron, sgdimitris, 03/09/2012
- Re: [cgal-discuss] Re: Take the triangles of a polyhedron, Philipp Moeller, 03/09/2012
- [cgal-discuss] Re: Take the triangles of a polyhedron, sgdimitris, 03/09/2012
- Re: [cgal-discuss] Re: Take the triangles of a polyhedron, Philipp Moeller, 03/09/2012
- [cgal-discuss] Re: Take the triangles of a polyhedron, sgdimitris, 03/09/2012
- Re: [cgal-discuss] Take the triangles of a polyhedron, Philipp Moeller, 03/09/2012
Archive powered by MHonArc 2.6.16.