CGAL 6.1 - 2D Conforming Triangulations and Meshes

Loading...
Searching...
No Matches
Mesh_2/mesh_marked_domain.cpp
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Constrained_Delaunay_triangulation_2.h>
#include <CGAL/Delaunay_mesher_2.h>
#include <CGAL/Delaunay_mesh_face_base_2.h>
#include <CGAL/Delaunay_mesh_size_criteria_2.h>
#include <CGAL/mark_domain_in_triangulation.h>
#include <CGAL/draw_constrained_triangulation_2.h>
#include <iostream>
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef CGAL::Triangulation_vertex_base_2<K> Vb;
typedef CGAL::Delaunay_mesh_face_base_2<K> Fb;
typedef CGAL::Triangulation_data_structure_2<Vb, Fb> Tds;
typedef CGAL::Constrained_Delaunay_triangulation_2<K, Tds> CDT;
typedef CDT::Vertex_handle Vertex_handle;
typedef CDT::Point Point;
int main()
{
CDT cdt;
Vertex_handle va = cdt.insert(Point(2,0));
Vertex_handle vb = cdt.insert(Point(0,2));
Vertex_handle vc = cdt.insert(Point(-2,0));
Vertex_handle vd = cdt.insert(Point(0,-2));
cdt.insert_constraint(va, vb);
cdt.insert_constraint(vb, vc);
cdt.insert_constraint(vc, vd);
cdt.insert_constraint(vd, va);
va = cdt.insert(Point(3,3));
vb = cdt.insert(Point(-3,3));
vc = cdt.insert(Point(-3,-3));
vd = cdt.insert(Point(3,0-3));
cdt.insert_constraint(va, vb);
cdt.insert_constraint(vb, vc);
cdt.insert_constraint(vc, vd);
cdt.insert_constraint(vd, va);
CGAL::mark_domain_in_triangulation(cdt);
std::cout << "Number of vertices: " << cdt.number_of_vertices() << std::endl;
std::cout << "Meshing the domain..." << std::endl;
CGAL::refine_Delaunay_mesh_2(cdt,
CGAL::parameters::domain_is_initialized(true));
std::cout << "Number of vertices: " << cdt.number_of_vertices() << std::endl;
std::cout << "Number of finite faces: " << cdt.number_of_faces() << std::endl;
int mesh_faces_counter = 0;
for(CDT::Finite_faces_iterator fit = cdt.finite_faces_begin();
fit != cdt.finite_faces_end(); ++fit)
{
if(fit->is_in_domain()) ++mesh_faces_counter;
}
std::cout << "Number of faces in the mesh domain: " << mesh_faces_counter << std::endl;
CGAL::draw(cdt);
}
CGAL::Constrained_Delaunay_triangulation_2
CGAL::Constrained_Delaunay_triangulation_2::insert
Vertex_handle insert(Point p, Face_handle f=Face_handle())
CGAL::Delaunay_mesh_face_base_2
The class Delaunay_mesh_face_base_2 is a model for the concept DelaunayMeshFaceBase_2.
Definition: Delaunay_mesh_face_base_2.h:29
CGAL::Exact_predicates_inexact_constructions_kernel
CGAL::Triangulation_vertex_base_2
CGAL::draw
void draw(const T2 &at2, const GSOptions &gso)
CGAL::refine_Delaunay_mesh_2
void refine_Delaunay_mesh_2(CDT &t, const NamedParameters &np)
refines the domain defined by a constrained Delaunay triangulation into a mesh satisfying the criteri...
CGAL::mark_domain_in_triangulation
void mark_domain_in_triangulation(CT &ct, InDomainPmap ipm)