#include <CGAL/Mesh_triangulation_3.h>
#include <CGAL/Mesh_complex_3_in_triangulation_3.h>
#include <CGAL/Mesh_criteria_3.h>
#include <CGAL/Polyhedron_3.h>
#include <CGAL/Polyhedral_mesh_domain_3.h>
#include <CGAL/make_mesh_3.h>
#include <CGAL/refine_mesh_3.h>
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/point_generators_3.h>
#include <iostream>
typedef CGAL::Polyhedron_3<K> Polyhedron;
#ifdef CGAL_CONCURRENT_MESH_3
#else
#endif
typedef CGAL::Mesh_complex_3_in_triangulation_3<Tr> C3t3;
typedef Tr::Bare_point Point;
int main()
{
std::vector<Point> points;
Polyhedron polyhedron;
polyhedron.make_tetrahedron(Point(-1,0,0), Point(0,1,0), Point(1,0,0), Point(0,0,-1));
Mesh_domain domain(polyhedron);
Mesh_criteria criteria(facet_angle=25, facet_size=0.15, facet_distance=0.008,
cell_radius_edge_ratio=3);
C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria, no_perturb(), no_exude());
std::copy_n( g, 100, std::back_inserter(points));
assert( points.size() == 100);
std::cout << points[0] << std::endl;
return 0;
}
The class Random_points_in_tetrahedral_mesh_boundary_3 is an input iterator creating points uniformly...
Definition: point_generators_3.h:555