CGAL 6.1.1 - 3D Convex Hulls

Loading...
Searching...
No Matches
Convex_hull_3/quickhull_indexed_triangle_set_3.cpp
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/convex_hull_3.h>
#include <vector>
#include <array>
#include <fstream>
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef K::Point_3 Point_3;
int main(int argc, char* argv[])
{
std::ifstream in( (argc>1)? argv[1] : "data/cube.xyz");
std::vector<Point_3> points;
std::vector<Point_3> vertices;
std::vector<std::array<int,3> > faces;
Point_3 p;
while(in >> p){
points.push_back(p);
}
CGAL::convex_hull_3(points.begin(), points.end(), vertices, faces);
std::cout << vertices.size() << " " << faces.size() << std::endl;
return 0;
}
CGAL::Exact_predicates_inexact_constructions_kernel
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).