#include #include #include #include #include #include #include typedef CGAL::Exact_predicates_inexact_constructions_kernel K; typedef CGAL::Projection_traits_xy_3 Gt; typedef CGAL::Triangulation_vertex_base_2 Vb; typedef CGAL::Delaunay_mesh_face_base_2 Fb; typedef CGAL::Triangulation_data_structure_2 TDS; typedef CGAL::Constrained_Delaunay_triangulation_2 Delaunay; typedef CGAL::Delaunay_mesh_size_criteria_2 Criteria; typedef K::Point_3 Point; int main() { Delaunay dt; typedef Delaunay::Vertex_handle Vertex_handle; Vertex_handle va = dt.insert(Point(-4,0, 0)); Vertex_handle vb = dt.insert(Point(0,-1, 0)); Vertex_handle vc = dt.insert(Point(4,0, 0)); Vertex_handle vd = dt.insert(Point(0,1,0)); dt.insert(Point(2, 0.6, 0)); dt.insert_constraint(va, vb); dt.insert_constraint(vb, vc); dt.insert_constraint(vc, vd); dt.insert_constraint(vd, va); CGAL::refine_Delaunay_mesh_2(dt, Criteria(0.125, 0.5)); // dt.insert(begin, end); std::cout << dt.number_of_vertices() << std::endl; return 0; }