[WIP] CGAL 3D conforming constrained Delaunay triangulation

.gitignore

@@ -1205,3 +1205,24 @@ Polygonal_surface_reconstruction/examples/build*
 Polygonal_surface_reconstruction/test/build*
 Solver_interface/examples/build*
 /Mesh_3/examples/Mesh_3/indicator_0.inr.gz
+dump-*.xyz
+dump-*.binary.cgal
+dump_*.txt
+dump_*.off
+dump-*.polylines.txt
+all_segments.polylines.txt
+Data/data/meshes/*.*.vtk
+Data/data/meshes/*.*.ele
+Data/data/meshes/*.*.face
+Data/data/meshes/*.*.edge
+Data/data/meshes/*.*.node
+Data/data/meshes/*.*.mesh
+Data/data/meshes/*.*.smesh
+Data/data/meshes/*.off-cdt-output.off
+Data/data/meshes/*.log
+/*.off
+/*.xyz
+log.txt
+/r0*
+patches_after_merge.ply
+dump.off.mesh

Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationCellBase_3.h

@@ -0,0 +1,30 @@
+/*!
+\ingroup PkgCT_3Concepts
+\cgalConcept
+
+The concept `ConformingConstrainedDelaunayTriangulationCellBase_3` refines the concept
+`TriangulationCellBase_3` and is the base cell class for
+the `CGAL::make_conforming_constrained_Delaunay_triangulation_3()` function template.
+
+\cgalRefines{TriangulationCellBase_3, BaseWithTimeStamp}
+
+\cgalHasModelsBegin
+\cgalHasModels{CGAL::Conforming_constrained_Delaunay_triangulation_cell_base_3}
+\cgalHasModelsEnd
+
+\sa `ConformingConstrainedDelaunayTriangulationVertexBase_3`
+*/
+class ConformingConstrainedDelaunayTriangulationCellBase_3 {
+public:
+
+  /// @name Access Functions
+  ///
+  /// The following functions return a reference to an object of type
+  /// `CGAL::Conforming_constrained_Delaunay_triangulation_cell_data_3`, that contains
+  /// the per-cell data required by the implementation of the
+  /// `CGAL::make_conforming_constrained_Delaunay_triangulation_3()` function template.
+  /// @{
+  CGAL::Conforming_constrained_Delaunay_triangulation_cell_data_3& ccdt_3_data();
+  const CGAL::Conforming_constrained_Delaunay_triangulation_cell_data_3& ccdt_3_data() const;
+  /// @}
+};

Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationTraits_3.h

@@ -0,0 +1,22 @@
+/*!
+\ingroup PkgCT_3Concepts
+\cgalConcept
+
+The concept `ConformingConstrainedDelaunayTriangulationTraits_3` specifies the requirements
+for the geometric traits class of the triangulation used as the first template
+parameter `Triangulation_3` in the function template
+`CGAL::make_conforming_constrained_Delaunay_triangulation_3()`.
+
+\cgalRefines{DelaunayTriangulationTraits_3}
+
+\cgalHasModelsBegin
+\cgalHasModels{CGAL::Exact_predicates_inexact_constructions_kernel (recommended)}
+\cgalHasModelsBare{all %CGAL kernels}
+\cgalHasModelsEnd
+
+\todo Add the requirements in the concept `ConformingConstrainedDelaunayTriangulationTraits_3`.
+
+*/
+class ConformingConstrainedDelaunayTriangulationTraits_3 {
+public:
+};

Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConstrainedDelaunayTriangulationVertexBase_3.h

@@ -0,0 +1,31 @@
+/*!
+\ingroup PkgCT_3Concepts
+\cgalConcept
+
+The concept `ConformingConstrainedDelaunayTriangulationVertexBase_3` refines the concept
+`TriangulationVertexBase_3` and is the base vertex class for
+the `CGAL::make_conforming_constrained_Delaunay_triangulation_3()` function template.
+
+\cgalRefines{TriangulationVertexBase_3, BaseWithTimeStamp}
+
+\cgalHasModelsBegin
+\cgalHasModels{CGAL::Conforming_constrained_Delaunay_triangulation_vertex_base_3}
+\cgalHasModelsEnd
+
+\sa `ConformingConstrainedDelaunayTriangulationCellBase_3`
+
+*/
+class ConformingConstrainedDelaunayTriangulationVertexBase_3 {
+public:
+
+  /// @name Access Functions
+  ///
+  /// The following functions return a reference to an object of type
+  /// `CGAL::Conforming_constrained_Delaunay_triangulation_vertex_data_3`, that contains
+  /// the per-vertex data required by the implementation of the
+  /// `CGAL::make_conforming_constrained_Delaunay_triangulation_3()` function template.
+  /// @{
+  CGAL::Conforming_constrained_Delaunay_triangulation_vertex_data_3& ccdt_3_data();
+  const CGAL::Conforming_constrained_Delaunay_triangulation_vertex_data_3& ccdt_3_data() const;
+  /// @}
+}

Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt

@@ -0,0 +1,32 @@
+namespace CGAL {
+/*!
+
+\mainpage User Manual
+\anchor Chapter_CT_3
+\cgalAutoToc
+\author Laurent Rineau
+
+This chapter describes the ...
+
+ * \todo Explain what is a CDT. Why a given input, like a polyhedron, might not admit a constrained Delaunay triangulation.
+ * Explain "conforming to the faces of a polygon mesh".
+ *
+
+\section CT_3_definitions Definitions
+
+Section on definitions here ...
+
+\section CT_3examples Examples
+
+\subsection myFirstExample First Example
+
+The following example shows ...
+
+\cgalExample{Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3.cpp }
+
+or from a polygon soup ...
+
+\cgalExample{Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3_from_soup.cpp }
+
+*/
+} /* namespace CGAL */

Constrained_triangulation_3/doc/Constrained_triangulation_3/Doxyfile.in

@@ -0,0 +1,6 @@
+@INCLUDE = ${CGAL_DOC_PACKAGE_DEFAULTS}
+PROJECT_NAME = "CGAL ${CGAL_DOC_VERSION} - 3D Constrained Triangulations"
+
+INPUT += ${CGAL_PACKAGE_INCLUDE_DIR}
+EXAMPLE_PATH += ${CGAL_PACKAGE_DOC_DIR}/doc_fragments
+QUIET = YES

Constrained_triangulation_3/doc/Constrained_triangulation_3/PackageDescription.txt

@@ -0,0 +1,56 @@
+/*!
+\defgroup PkgCT_3Ref 3D Constrained Triangulations Reference
+
+\defgroup PkgCT_3Concepts Concepts
+\ingroup PkgCT_3Ref
+
+\defgroup PkgCT_3Functions Function Templates
+\ingroup PkgCT_3Ref
+
+\defgroup PkgCT_3Classes Classes and Class Templates
+\ingroup PkgCT_3Ref
+
+\addtogroup PkgCT_3Ref
+\cgalPkgDescriptionBegin{3D Constrained Triangulations,PkgCT_3}
+\cgalPkgPicture{cdt3-small.png}
+
+\cgalPkgSummaryBegin
+\cgalPkgAuthors{Laurent Rineau}
+\cgalPkgDesc{This package allows to build and handle 3D constrained Delaunay triangulations.}
+\todo Add more description.
+\cgalPkgManuals{Chapter_CT_3,PkgCT_3Ref}
+\cgalPkgSummaryEnd
+
+\cgalPkgShortInfoBegin
+\cgalPkgSince{6.1}
+\cgalPkgDependsOn{\ref PkgTriangulation3 "3D Triangulations"}
+\cgalPkgBib{cgal:x-x}
+\cgalPkgLicense{\ref licensesGPL "GPL"}
+\noop \cgalPkgDemo{DEMO 2,demo2.zip}
+\todo Add a demo
+
+\cgalPkgShortInfoEnd
+
+\cgalPkgDescriptionEnd
+
+\cgalClassifedRefPages
+`CGAL::make_conforming_constrained_Delaunay_triangulation_3()` is the main function to create
+a conforming constrained Delaunay triangulation in 3D, an instance of the class template
+`CGAL::Conforming_constrained_Delaunay_triangulation_3`.
+
+\cgalCRPSection{Functions Templates}
+
+- `CGAL::make_conforming_constrained_Delaunay_triangulation_3()`
+
+\cgalCRPSection{Concepts}
+
+- `ConformingConstrainedDelaunayTriangulationTraits_3`
+- `ConformingConstrainedDelaunayTriangulationVertexBase_3`
+- `ConformingConstrainedDelaunayTriangulationCellBase_3`
+
+\cgalCRPSubsection{Class Templates}
+
+- `CGAL::Conforming_constrained_Delaunay_triangulation_3<Traits, Triangulation>`
+- `CGAL::Conforming_constrained_Delaunay_triangulation_vertex_base_3<Traits, Vertex_base>`
+- `CGAL::Conforming_constrained_Delaunay_triangulation_cell_base_3<Traits, Cell_base>`
+*/

Constrained_triangulation_3/doc/Constrained_triangulation_3/dependencies

@@ -0,0 +1,9 @@
+BGL
+Kernel_23
+Manual
+SMDS_3
+STL_Extension
+TDS_3
+Tetrahedral_remeshing
+Triangulation_3
+Polygon_mesh_processing

Constrained_triangulation_3/doc/Constrained_triangulation_3/doc_fragments/CDT_3_common_named_parameters.dox-frag

@@ -0,0 +1,5 @@
+\cgalParamNBegin{geom_traits}
+  \cgalParamDescription{an instance of a geometric traits class}
+  \cgalParamType{`Traits` as defined above in the section \ref make_conforming_constrained_Delaunay_triangulation_3_returned_type}
+  \cgalParamDefault{the default constructed traits object `Traits{}`}
+\cgalParamNEnd

Constrained_triangulation_3/doc/Constrained_triangulation_3/doc_fragments/CDT_3_common_template_parameters.dox-frag

@@ -0,0 +1,3 @@
+\tparam Triangulation an instance of the `CGAL::Conforming_constrained_Delaunay_triangulation_3` class template,
+  or `CGAL::Default`
+\tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"

Constrained_triangulation_3/doc/Constrained_triangulation_3/doc_fragments/CDT_3_description_of_input.dox-frag

@@ -0,0 +1,12 @@
+  The input data (polygon mesh or polygon soup) represents the polygonal constraints enforced
+  during the triangulation process.
+
+  By default, each face of the input is considered a polygonal constraint for the triangulation. The
+  named parameter `face_patch_map` can be used to describe larger polygonal constraints, possibly with holes. If
+  used, this parameter must be a property map that associates each face of the input with a patch
+  identifier. Faces with the same patch identifier are considered part of the same surface patch. Each of these
+  surface patches (defined as the union of the input faces with a given patch identifier) is expected to be a polygon or a
+  polygon with holes, with coplanar vertices (or nearly coplanar up to the precision of the number type used).
+
+  The generated triangulation will conform to the faces of the input or to the surface patches
+  described by the `face_patch_map` property map if provided.

Constrained_triangulation_3/doc/Constrained_triangulation_3/examples.txt

@@ -0,0 +1,18 @@
+/*!
+\example Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3.cpp
+Simple example demonstrating the usage of the Constrained_triangulation_3 package.
+
+It constructs a 3D constrained Delaunay triangulation from a polygon mesh.
+*/
+
+/*!
+\example Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3_from_soup.cpp
+Simple example demonstrating the usage of the Constrained_triangulation_3 package.
+
+It constructs a constrained Delaunay triangulation from a polygon soup.
+*/
+
+/*!
+\example Constrained_triangulation_3/remesh_constrained_Delaunay_triangulation_3.cpp
+How to use `CGAL::tetrahedral_isotropic_remeshing` with a constrained Delaunay triangulation.
+*/

Constrained_triangulation_3/examples/Constrained_triangulation_3/CMakeLists.txt

@@ -0,0 +1,14 @@
+cmake_minimum_required(VERSION 3.1...3.23)
+project(Constrained_triangulation_3_Examples)
+
+find_package(CGAL REQUIRED COMPONENTS Qt6)
+
+create_single_source_cgal_program(conforming_constrained_Delaunay_triangulation_3.cpp)
+create_single_source_cgal_program(conforming_constrained_Delaunay_triangulation_3_from_soup.cpp)
+create_single_source_cgal_program(remesh_constrained_Delaunay_triangulation_3.cpp)
+
+if(CGAL_Qt6_FOUND)
+  target_link_libraries(conforming_constrained_Delaunay_triangulation_3 PUBLIC CGAL::CGAL_Basic_viewer)
+else()
+  message(STATUS "NOTICE: The example 'conforming_constrained_Delaunay_triangulation_3' requires Qt6, and will not be compiled.")
+endif()

Constrained_triangulation_3/examples/Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3.cpp

@@ -0,0 +1,32 @@
+#include <CGAL/make_conforming_constrained_Delaunay_triangulation_3.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/draw_triangulation_3.h>
+
+#include <algorithm>
+
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
+
+int main(int argc, char* argv[])
+{
+  CGAL::Surface_mesh<K::Point_3> mesh;
+
+  auto filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/mpi.off");
+  std::ifstream in(filename);
+  if(!in || !CGAL::IO::read_OFF(in, mesh)) {
+    std::cerr << "Error: cannot read file " << filename << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::cout << "Read " << mesh.number_of_vertices() << " vertices and "
+            << mesh.number_of_faces() << " faces" << std::endl;
+
+  auto ccdt = CGAL::make_conforming_constrained_Delaunay_triangulation_3(mesh);
+
+  std::cout << "Number of vertices in the CDT: "
+            << ccdt.triangulation().number_of_vertices() << '\n'
+            << "Number of constrained facets in the CDT: "
+            << ccdt.number_of_constrained_facets() << '\n';
+
+  CGAL::draw(ccdt.triangulation());
+}

Constrained_triangulation_3/examples/Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3_from_soup.cpp

@@ -0,0 +1,33 @@
+#include <CGAL/make_conforming_constrained_Delaunay_triangulation_3.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <vector>
+#include <CGAL/draw_triangulation_3.h>
+
+#include <algorithm>
+
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
+
+int main(int argc, char* argv[])
+{
+  std::vector<K::Point_3> points;
+  std::vector<std::vector<std::size_t>> polygons;
+
+  auto filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/cubes.off");
+  std::ifstream in(filename);
+  if(!in || !CGAL::IO::read_OFF(in, points, polygons)) {
+    std::cerr << "Error: cannot read file " << filename << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::cout << "Read " << points.size() << " vertices and "
+            << polygons.size() << " polygons" << std::endl;
+
+  auto ccdt = CGAL::make_conforming_constrained_Delaunay_triangulation_3(points, polygons);
+
+  std::cout << "Number of vertices in the CDT: "
+            << ccdt.triangulation().number_of_vertices() << '\n'
+            << "Number of constrained facets in the CDT: "
+            << ccdt.number_of_constrained_facets() << '\n';
+
+  CGAL::draw(ccdt.triangulation());
+}

Constrained_triangulation_3/examples/Constrained_triangulation_3/remesh_constrained_Delaunay_triangulation_3.cpp

@@ -0,0 +1,43 @@
+#define CGAL_TETRAHEDRAL_REMESHING_VERBOSE 1
+#define CGAL_TETRAHEDRAL_REMESHING_DEBUG 1
+
+#include <CGAL/make_conforming_constrained_Delaunay_triangulation_3.h>
+
+#include <CGAL/tetrahedral_remeshing.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/draw_triangulation_3.h>
+
+#include <fstream>
+#include <string>
+
+using K   = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Vb  = CGAL::Conforming_constrained_Delaunay_triangulation_vertex_base_3<K>;
+using Cb  = CGAL::Conforming_constrained_Delaunay_triangulation_cell_base_3<K>;
+using Tds = CGAL::Triangulation_data_structure_3<Vb, Cb>;
+using Tr  = CGAL::Triangulation_3<K, Tds>;
+using CCDT = CGAL::Conforming_constrained_Delaunay_triangulation_3<K, Tr>;
+
+int main(int argc, char* argv[])
+{
+  std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/mpi.off");
+  std::ifstream in(filename);
+
+  CGAL::Surface_mesh<K::Point_3> mesh;
+  if(!in || !CGAL::IO::read_OFF(in, mesh)) {
+    std::cerr << "Error: cannot read file " << filename << std::endl;
+    return EXIT_FAILURE;
+  }
+  CCDT ccdt = CGAL::make_conforming_constrained_Delaunay_triangulation_3<CCDT>(mesh);
+  //! [move ccdt to tr]
+  Tr tr = std::move(ccdt).triangulation();
+  //! [move ccdt to tr]
+  std::cout << "Number of vertices in tr: "
+            << tr.number_of_vertices() << std::endl;
+  CGAL::tetrahedral_isotropic_remeshing(tr, 0.1,
+    CGAL::parameters::number_of_iterations(3));
+
+  std::cout << "Number of vertices in tr: "
+            << tr.number_of_vertices() << std::endl;
+  CGAL::draw(ccdt.triangulation());
+}