Extra: The geometric traits class must be compatible with the vertex point type.
If true, use the Delaunay triangulation facet search space.
Type: Boolean
Default: true
Extra: If no valid triangulation can be found in this search space, the algorithm falls back to the non-Delaunay triangulations search space to find a solution.
If true, the points of the boundary of the hole are used to estimate a fitting plane and a 2D constrained Delaunay triangulation is then used to fill the hole projected in the fitting plane.
Type: Boolean
Default: true
Extra: If the boundary of the hole is not planar (according to the parameter threshold_distance) or if no valid 2D triangulation can be found, the algorithm falls back to the method using the 3D Delaunay triangulation. This parameter is a good choice for near planar holes.
The maximum distance between the vertices of the hole boundary and the least squares plane fitted to this boundary.
Type: double
Default: one quarter of the height of the bounding box of the hole
Extra: This parameter is used only in conjunction with the parameter use_2d_constrained_delaunay_triangulation.
Set this parameter to true if you only want to use the Delaunay based versions of the algorithm, skipping the cubic search space one in case of failure.
Type: Boolean
Default: false
Extra: If true, use_2d_constrained_delaunay_triangulation or use_delaunay_triangulation must be set to true otherwise nothing will be done.
factor to control density of the output mesh, where larger values cause denser refinements, as in refine()
Type: double
Default: \( \sqrt{2}\)
a visitor used to track when entering a given phase of the algorithm
This function is deprecated since CGAL 5.6 and the overload with the named parameters face_output_iterator and vertex_output_iterator should be used instead.
Depending on the choice of the underlying algorithm different preconditions apply. When using the 2D constrained Delaunay triangulation, the border edges of the hole must not intersect the surface. Otherwise, additionally, the boundary of the hole must not contain any non-manifold vertex. The patch generated does not introduce non-manifold edges nor degenerate triangles. If a hole cannot be triangulated, pmesh is not modified and nothing is recorded in the face output iterator.
Extra: The geometric traits class must be compatible with the vertex point type.
If true, use the Delaunay triangulation facet search space.
Type: Boolean
Default: true
Extra: If no valid triangulation can be found in this search space, the algorithm falls back to the non-Delaunay triangulations search space to find a solution.
If true, the points of the boundary of the hole are used to estimate a fitting plane and a 2D constrained Delaunay triangulation is then used to fill the hole projected in the fitting plane.
Type: Boolean
Default: true
Extra: If the boundary of the hole is not planar (according to the parameter threshold_distance) or if no valid 2D triangulation can be found, the algorithm falls back to the method using the 3D Delaunay triangulation. This parameter is a good choice for near planar holes.
The maximum distance between the vertices of the hole boundary and the least squares plane fitted to this boundary.
Type: double
Default: one quarter of the height of the bounding box of the hole
Extra: This parameter is used only in conjunction with the parameter use_2d_constrained_delaunay_triangulation.
Set this parameter to true if you only want to use the Delaunay based versions of the algorithm, skipping the cubic search space one in case of failure.
Type: Boolean
Default: false
Extra: If true, use_2d_constrained_delaunay_triangulation or use_delaunay_triangulation must be set to true otherwise nothing will be done.
a visitor used to track when entering a given phase of the algorithm
creates triangles to fill the hole defined by points in the range points.
Triangles are recorded into out using the indices of the input points in the range points. Note that no degenerate triangles will be produced. If no triangulation can be found, then nothing is recorded in out.
If faces incident to the polyline outside the hole are known, it is recommended to use this function. The point range third_points indicates for each pair of consecutive points in the range points, the third point of the face this segment is incident to. It influences the choice of the best triangulation while avoiding overfolding.
Note that the ranges points and third_points may or may not contain duplicated first point at the end of sequence.
model of OutputIterator, to collect patch faces. A specialization for CGAL::value_type_traits<OutputIterator> must be available, and the corresponding value type type must have a constructor type(int p0, int p1, int p2) available. The indices correspond to the ones of input points in points.
Extra: The geometric traits class must be compatible with the vertex point type.
If true, use the Delaunay triangulation facet search space.
Type: Boolean
Default: true
Extra: If no valid triangulation can be found in this search space, the algorithm falls back to the non-Delaunay triangulations search space to find a solution.
If true, the points of the boundary of the hole are used to estimate a fitting plane and a 2D constrained Delaunay triangulation is then used to fill the hole projected in the fitting plane.
Type: Boolean
Default: true
Extra: If the boundary of the hole is not planar (according to the parameter threshold_distance) or if no valid 2D triangulation can be found, the algorithm falls back to the method using the 3D Delaunay triangulation. This parameter is a good choice for near planar holes.
The maximum distance between the vertices of the hole boundary and the least squares plane fitted to this boundary.
Type: double
Default: one quarter of the height of the bounding box of the hole
Extra: This parameter is used only in conjunction with the parameter use_2d_constrained_delaunay_triangulation.
a visitor used to track when entering a given phase of the algorithm
Extra: The geometric traits class must be compatible with the vertex point type.
If true, use the Delaunay triangulation facet search space.
Type: Boolean
Default: true
Extra: If no valid triangulation can be found in this search space, the algorithm falls back to the non-Delaunay triangulations search space to find a solution.
If true, the points of the boundary of the hole are used to estimate a fitting plane and a 2D constrained Delaunay triangulation is then used to fill the hole projected in the fitting plane.
Type: Boolean
Default: true
Extra: If the boundary of the hole is not planar (according to the parameter threshold_distance) or if no valid 2D triangulation can be found, the algorithm falls back to the method using the 3D Delaunay triangulation. This parameter is a good choice for near planar holes.
The maximum distance between the vertices of the hole boundary and the least squares plane fitted to this boundary.
Type: double
Default: one quarter of the height of the bounding box of the hole
Extra: This parameter is used only in conjunction with the parameter use_2d_constrained_delaunay_triangulation.
factor to control density of the output mesh, where larger values cause denser refinements, as in refine()
Type: double
Default: \( \sqrt{2}\)
A value controlling the tangential continuity of the output surface patch. The possible values are 0, 1 and 2, referring to the C0, C1 and C2 continuity.
Type: unsigned int
Default: 1
Extra: The larger fairing_continuity gets, the more fixed vertices are required.
an instance of the sparse linear solver used for fairing
This function is deprecated since CGAL 5.6 and the overload with the named parameters face_output_iterator and vertex_output_iterator should be used instead.
1.8.13