1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
|
#define CGAL_MESH_3_VERBOSE 1
#include "generate_2d.hpp"
#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_vertex_base_2.h>
#include <CGAL/Delaunay_mesh_size_criteria_2.h>
#include <CGAL/lloyd_optimize_mesh_2.h>
namespace pygalmesh {
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef CGAL::Delaunay_mesh_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 CGAL::Delaunay_mesh_size_criteria_2<CDT> Criteria;
typedef CDT::Vertex_handle Vertex_handle;
typedef CDT::Point Point;
std::tuple<std::vector<std::array<double, 2>>, std::vector<std::array<int, 3>>>
generate_2d(
const std::vector<std::array<double, 2>> & points,
const std::vector<std::array<int, 2>> & constraints,
// See
// https://doc.cgal.org/latest/Mesh_2/classCGAL_1_1Delaunay__mesh__size__criteria__2.html#a58b0186eae407ba76b8f4a3d0aa85a1a
// for what the bounds mean. Spoiler:
// B = circumradius / shortest_edge,
// relates to the smallest angle via sin(alpha_min) = 1 / (2B)
// edge_size S: "all segments of all triangles must be shorter than a bound S."
const double max_circumradius_shortest_edge_ratio,
const double max_edge_size,
const int num_lloyd_steps
)
{
CDT cdt;
// construct a constrained triangulation
std::vector<Vertex_handle> vertices(points.size());
int k = 0;
for (auto pt: points) {
vertices[k] = cdt.insert(Point(pt[0], pt[1]));
k++;
}
for (auto c: constraints) {
cdt.insert_constraint(vertices[c[0]], vertices[c[1]]);
}
// create proper mesh
CGAL::refine_Delaunay_mesh_2(
cdt,
Criteria(
0.25 / (max_circumradius_shortest_edge_ratio * max_circumradius_shortest_edge_ratio),
max_edge_size
)
);
if (num_lloyd_steps > 0) {
CGAL::lloyd_optimize_mesh_2(
cdt,
CGAL::parameters::max_iteration_number = num_lloyd_steps
);
}
// convert points to vector of arrays
std::map<Vertex_handle, int> vertex_index;
std::vector<std::array<double, 2>> out_points(cdt.number_of_vertices());
k = 0;
for (auto vit: cdt.finite_vertex_handles()) {
out_points[k][0] = vit->point()[0];
out_points[k][1] = vit->point()[1];
vertex_index[vit] = k;
k++;
}
// https://github.com/CGAL/cgal/issues/5068#issuecomment-706213606
auto nb_faces = 0u;
for (auto fit: cdt.finite_face_handles()) {
if(fit->is_in_domain()) ++nb_faces;
}
std::vector<std::array<int, 3>> out_cells(nb_faces);
k = 0;
for (auto fit: cdt.finite_face_handles()) {
if(!fit->is_in_domain()) continue;
out_cells[k][0] = vertex_index[fit->vertex(0)];
out_cells[k][1] = vertex_index[fit->vertex(1)];
out_cells[k][2] = vertex_index[fit->vertex(2)];
k++;
}
return std::make_tuple(out_points, out_cells);
}
} // namespace pygalmesh
|
