CGAL 5.1 - 3D Convex Hulls
Convex_hull_3/quickhull_OM_3.cpp
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/convex_hull_3.h>
#include <vector>
#include <fstream>
#include <OpenMesh/Core/IO/MeshIO.hh>
#include <OpenMesh/Core/Mesh/TriMesh_ArrayKernelT.hh>
#include <CGAL/boost/graph/graph_traits_TriMesh_ArrayKernelT.h>
typedef K::Point_3
Point_3;
typedef OpenMesh::TriMesh_ArrayKernelT</* MyTraits*/> Mesh;
int main(int argc, char* argv[])
{
std::ifstream in( (argc>1)? argv[1] : "data/cube.xyz");
std::vector<Point_3> points;
Point_3 p, n;
while(in >> p >> n){
points.push_back(p);
}
// define polyhedron to hold convex hull
Mesh poly;
// compute convex hull of non-collinear points
CGAL::convex_hull_3(points.begin(), points.end(), poly);
Mesh sm;
CGAL::convex_hull_3(points.begin(), points.end(), sm);
CGAL::write_off((argc>2)?argv[2]:"out.off", sm);
return 0;
}
CGAL::Exact_predicates_inexact_constructions_kernel
CGAL::write_off
bool write_off(const Surface_mesh< K > &mesh, const std::string &filename)
CGAL::convex_hull_3
void convex_hull_3(InputIterator first, InputIterator last, PolygonMesh &pm, const Traits &ch_traits=Default_traits)
computes the convex hull of the set of points in the range [first, last). The polygon mesh pm is clea...