New: Implementation of CGAL functionalities for 2D.
-Convert a dealii cell to a CGAL::Polygon_2
-Convert a dealii triangulation to a CGAL::Polygon_2
-Perform boolean operation on two CGAL::Polygon_2
+They allow to convert a dealii cell or a
+dealii triangulation to CGAL::Polygon_with_holes_2.
+Moreover, boolean operations can be performed
+on two CGAL::Polygon_with_holes_2.
<br>
(Sascha Hofstetter, 2025/07/01)
New: GridTools::extract_ordered_boundary_vertices.
-The function returns a vector with all closed boundaries.
-Each closed boundary is a vector with vertices.
+The function returns a vector with all closed
+boundaries of a triangulation. Each closed boundary
+is represented as a vector with vertex indices and
+coordinates (as a pair).
The outer boundary is ordered counter clockwise,
inner boundaries are ordered clockwise.
<br>
* The vertices are in clockwise ordering for inner boundaries (holes).
*
* It is generally not guaranteed that the first entry of the vector is the
- * outer boundary. However, when cell 0 is located on the outer boundary it is
- * the case.
+ * outer boundary. However, when cell 0 is located on the outer boundary this
+ * is the case.
*
* The mapping argument enables the use of e.g. MappingQEulerian.
*
{"channel_with_cylinder", "0.03 : 2 : 2.0 : false"},
{"cheese", "2 , 2"}};
- for (const auto &info_pair : names_and_args)
+ for (const auto &[name, args] : names_and_args)
{
- auto name = info_pair.first;
- auto args = info_pair.second;
deallog << "Name: " << name << std::endl;
GridGenerator::generate_from_name_and_arguments(tria_in, name, args);