CGAL 5.1 - Polygon Mesh Processing

Functions to triangulate faces, and to refine and fair regions of a polygon mesh.

Functions

template<class InputMesh , class OutputMesh , class BottomFunctor , class TopFunctor , class NamedParameters1 , class NamedParameters2 >
void CGAL::Polygon_mesh_processing::extrude_mesh (const InputMesh &input, OutputMesh &output, const BottomFunctor &bot, const TopFunctor &top, const NamedParameters1 &np_in, const NamedParameters2 &np_out)
 performs a generalized extrusion of input and puts it in output. More...
 
template<class InputMesh , class OutputMesh , class NamedParameters1 , class NamedParameters2 >
void CGAL::Polygon_mesh_processing::extrude_mesh (const InputMesh &input, OutputMesh &output, Vector_3 v, const NamedParameters1 &np_in, const NamedParameters2 &np_out)
 
template<typename TriangleMesh , typename VertexRange , typename NamedParameters >
bool CGAL::Polygon_mesh_processing::fair (TriangleMesh &tmesh, const VertexRange &vertices, const NamedParameters &np)
 fairs a region on a triangle mesh. The points of the selected vertices are relocated to yield an as-smooth-as-possible surface patch, based on solving a linear bi-Laplacian system with boundary constraints, described in [3]. The optional parameter fairing_continuity gives the ability to control the tangential continuity C n of the output mesh. More...
 
template<typename VertexRange , typename TriangleMesh , typename NamedParameters >
void CGAL::Polygon_mesh_processing::random_perturbation (VertexRange vertices, TriangleMesh &tmesh, const double &perturbation_max_size, const NamedParameters &np)
 randomly perturbs the locations of vertices of a triangulated surface mesh. By default, the vertices are re-projected onto the input surface after perturbation. Note that no geometric checks are done after the perturbation (face orientation might become incorrect and self-intersections might be introduced). More...
 
template<typename TriangleMesh , typename NamedParameters >
void CGAL::Polygon_mesh_processing::random_perturbation (TriangleMesh &tmesh, const double &perturbation_max_size, const NamedParameters &np)
 same as above, but all non-border vertices of tmesh are perturbed.
 
template<typename TriangleMesh , typename FaceRange , typename FaceOutputIterator , typename VertexOutputIterator , typename NamedParameters >
std::pair< FaceOutputIterator, VertexOutputIterator > CGAL::Polygon_mesh_processing::refine (TriangleMesh &tmesh, const FaceRange &faces, FaceOutputIterator faces_out, VertexOutputIterator vertices_out, const NamedParameters &np)
 refines a region of a triangle mesh More...
 
template<typename PolygonMesh , typename FaceRange , typename NamedParameters >
void CGAL::Polygon_mesh_processing::isotropic_remeshing (const FaceRange &faces, const double &target_edge_length, PolygonMesh &pmesh, const NamedParameters &np)
 remeshes a triangulated region of a polygon mesh. This operation sequentially performs edge splits, edge collapses, edge flips, tangential relaxation and projection to the initial surface to generate a smooth mesh with a prescribed edge length. More...
 
template<typename PolygonMesh , typename EdgeRange , typename NamedParameters >
void CGAL::Polygon_mesh_processing::split_long_edges (const EdgeRange &edges, const double &max_length, PolygonMesh &pmesh, const NamedParameters &np)
 splits the edges listed in edges into sub-edges that are not longer than the given threshold max_length. More...
 
template<typename TriangleMesh , typename FaceRange , typename NamedParameters >
void CGAL::Polygon_mesh_processing::smooth_mesh (const FaceRange &faces, TriangleMesh &tmesh, const NamedParameters &np)
 smoothes a triangulated region of a polygon mesh. More...
 
template<typename TriangleMesh , typename FaceRange , typename NamedParameters >
void CGAL::Polygon_mesh_processing::smooth_shape (const FaceRange &faces, TriangleMesh &tmesh, const double time, const NamedParameters &np)
 
template<typename PolygonMesh , typename NamedParameters >
bool CGAL::Polygon_mesh_processing::triangulate_face (typename boost::graph_traits< PolygonMesh >::face_descriptor f, PolygonMesh &pmesh, const NamedParameters &np)
 
template<typename FaceRange , typename PolygonMesh , typename NamedParameters >
bool CGAL::Polygon_mesh_processing::triangulate_faces (FaceRange face_range, PolygonMesh &pmesh, const NamedParameters &np)
 
template<typename PolygonMesh , typename NamedParameters >
bool CGAL::Polygon_mesh_processing::triangulate_faces (PolygonMesh &pmesh, const NamedParameters &np)
 

Function Documentation

◆ extrude_mesh() [1/2]

template<class InputMesh , class OutputMesh , class BottomFunctor , class TopFunctor , class NamedParameters1 , class NamedParameters2 >
void CGAL::Polygon_mesh_processing::extrude_mesh ( const InputMesh &  input,
OutputMesh &  output,
const BottomFunctor &  bot,
const TopFunctor &  top,
const NamedParameters1 &  np_in,
const NamedParameters2 &  np_out 
)

#include <CGAL/Polygon_mesh_processing/extrude.h>

performs a generalized extrusion of input and puts it in output.

This function extrudes the open surface mesh input and puts the result in output. The mesh generated is a closed surface mesh with a bottom and top part, both having the same graph combinatorics as input (except that the orientation of the faces of the bottom part is reversed). The bottom and the top parts are connected by a triangle strip between boundary cycles. The coordinates of the points associated to the vertices of the bottom and top part are first initialized to the same value as the corresponding vertices of input. Then for each vertex, a call to bot and top is done for the vertices of the bottom part and the top part, respectively.

Attention
output may be self intersecting.
Template Parameters
InputMesha model of FaceListGraph
OutputMesha model of FaceListGraph and MutableFaceGraph
NamedParameters1a sequence of Named Parameters for InputMesh
NamedParameters2a sequence of Named Parameters for OutputMesh
BottomFunctora functor providing
void operator()`(boost::graph_traits<InputMesh>::vertex_descriptor input_v,boost::graph_traits<OutputMesh>::vertex_descriptor output_v)
where output_v is the copy of input_v from input into the bottom part of output.
TopFunctora functor providing a similar operator() as BottomFunctor.
Parameters
inputan open surface mesh to extrude.
outputa surface mesh that will contain the result of the extrusion.
botfunctor that will transform all points copied from input in order to shape the bottom part of the extrusion.
topfunctor that will transform all points copied from input in order to shape the top part of the extrusion.
np_inan optional sequence of Named Parameters among the ones listed below
Named Parameters
vertex_point_mapthe property map that contains the points associated to the vertices of input. If this parameter is omitted, an internal property map for CGAL::vertex_point_t should be available for the vertices of input
Parameters
np_outan optional sequence of Named Parameters among the ones listed below
Named Parameters
vertex_point_mapthe property map that will contain the points associated to the vertices of output. If this parameter is omitted, an internal property map for CGAL::vertex_point_t should be available for the vertices of output

◆ extrude_mesh() [2/2]

template<class InputMesh , class OutputMesh , class NamedParameters1 , class NamedParameters2 >
void CGAL::Polygon_mesh_processing::extrude_mesh ( const InputMesh &  input,
OutputMesh &  output,
Vector_3  v,
const NamedParameters1 &  np_in,
const NamedParameters2 &  np_out 
)

#include <CGAL/Polygon_mesh_processing/extrude.h>

fills output with a closed mesh bounding the volume swept by input when translating its vertices by v. The mesh is oriented so that the faces corresponding to input in output have the same orientation.

Attention
output may be self intersecting.
Template Parameters
InputMesha model of the concept FaceListGraph
OutputMesha model of the concept FaceListGraph and MutableFaceGraph
Vector_3vector type from the same CGAL kernel as the point of the vertex point map used for OutputMesh.
NamedParameters1a sequence of Named Parameters for InputMesh
NamedParameters2a sequence of Named Parameters for OutputMesh
Parameters
inputan open surface mesh to extrude.
outputa surface mesh that will contain the result of the extrusion.
vthe vector defining the direction of the extrusion
np_inan optional sequence of Named Parameters among the ones listed below
Named Parameters
vertex_point_mapthe property map that contains the points associated to the vertices of input. If this parameter is omitted, an internal property map for CGAL::vertex_point_t should be available for the vertices of input
Parameters
np_outan optional sequence of Named Parameters among the ones listed below
Named Parameters
vertex_point_mapthe property map that will contain the points associated to the vertices of output. If this parameter is omitted, an internal property map for CGAL::vertex_point_t should be available for the vertices of output

◆ fair()

template<typename TriangleMesh , typename VertexRange , typename NamedParameters >
bool CGAL::Polygon_mesh_processing::fair ( TriangleMesh &  tmesh,
const VertexRange &  vertices,
const NamedParameters &  np 
)

#include <CGAL/Polygon_mesh_processing/fair.h>

fairs a region on a triangle mesh. The points of the selected vertices are relocated to yield an as-smooth-as-possible surface patch, based on solving a linear bi-Laplacian system with boundary constraints, described in [3]. The optional parameter fairing_continuity gives the ability to control the tangential continuity C n of the output mesh.

The region described by vertices might contain multiple disconnected components. Note that the mesh connectivity is not altered in any way, only vertex locations get updated.

Fairing might fail if fixed vertices, which are used as boundary conditions, do not suffice to solve constructed linear system.

Note that if the vertex range to which fairing is applied contains all the vertices of the triangle mesh, fairing does not fail, but the mesh gets shrinked to CGAL::ORIGIN.

Template Parameters
TriangleMesha model of FaceGraph and MutableFaceGraph
VertexRangea range of vertex descriptors of TriangleMesh, model of Range. Its iterator type is InputIterator.
NamedParametersa sequence of Named Parameters
Parameters
tmeshthe triangle mesh with patches to be faired
verticesthe vertices of the patches to be faired (the positions of only those vertices will be changed)
npoptional sequence of Named Parameters among the ones listed below
Named Parameters
vertex_point_mapthe property map with the points associated to the vertices of tmesh. If this parameter is omitted, an internal property map for CGAL::vertex_point_t must be available in TriangleMesh
fairing_continuitytangential continuity of the output surface patch. The larger fairing_continuity gets, the more fixed vertices are required
sparse_linear_solveran instance of the sparse linear solver used for fairing
Returns
true if fairing is successful, otherwise no vertices are relocated
Precondition
is_triangle_mesh(tmesh)
Warning
This function involves linear algebra, that is computed using a non-exact floating-point arithmetic.
Todo:
accuracy of solvers are not good, for example when there is no boundary condition pre_factor should fail, but it does not.
Examples
Polygon_mesh_processing/refine_fair_example.cpp.

◆ isotropic_remeshing()

template<typename PolygonMesh , typename FaceRange , typename NamedParameters >
void CGAL::Polygon_mesh_processing::isotropic_remeshing ( const FaceRange &  faces,
const double &  target_edge_length,
PolygonMesh &  pmesh,
const NamedParameters &  np 
)

#include <CGAL/Polygon_mesh_processing/remesh.h>

remeshes a triangulated region of a polygon mesh. This operation sequentially performs edge splits, edge collapses, edge flips, tangential relaxation and projection to the initial surface to generate a smooth mesh with a prescribed edge length.

Template Parameters
PolygonMeshmodel of MutableFaceGraph. The descriptor types boost::graph_traits<PolygonMesh>::face_descriptor and boost::graph_traits<PolygonMesh>::halfedge_descriptor must be models of Hashable.
FaceRangerange of boost::graph_traits<PolygonMesh>::face_descriptor, model of Range. Its iterator type is ForwardIterator.
NamedParametersa sequence of Named Parameters
Parameters
pmesha polygon mesh with triangulated surface patches to be remeshed
facesthe range of triangular faces defining one or several surface patches to be remeshed
target_edge_lengththe edge length that is targeted in the remeshed patch. If 0 is passed then only the edge-flip, tangential relaxation, and projection steps will be done.
npoptional sequence of Named Parameters among the ones listed below
Precondition
if constraints protection is activated, the constrained edges must not be longer than 4/3*target_edge_length
Named Parameters
geom_traitsa geometric traits class instance, model of Kernel. Exact constructions kernels are not supported by this function.
vertex_point_mapthe property map with the points associated to the vertices of pmesh. Instance of a class model of ReadWritePropertyMap.
face_index_mapa property map containing the index of each face of pmesh
number_of_iterationsthe number of iterations for the sequence of atomic operations performed (listed in the above description)
edge_is_constrained_mapa property map containing the constrained-or-not status of each edge of pmesh. A constrained edge can be split or collapsed, but not flipped, nor its endpoints moved by smoothing. Sub-edges generated by splitting are set to be constrained. Note that patch boundary edges (i.e. incident to only one face in the range) are always considered as constrained edges.
vertex_is_constrained_mapa property map containing the constrained-or-not status of each vertex of pmesh. A constrained vertex cannot be modified at all during remeshing
protect_constraintsIf true, the edges set as constrained in edge_is_constrained_map (or by default the boundary edges) are not split nor collapsed during remeshing. Note that around constrained edges that have their length higher than twice target_edge_length, remeshing will fail to provide good quality results. It can even fail to terminate because of cascading vertex insertions.
collapse_constraintsIf true, the edges set as constrained in edge_is_constrained_map (or by default the boundary edges) are collapsed during remeshing. This value is ignored if protect_constraints is true;
face_patch_mapa property map with the patch id's associated to the faces of faces. Instance of a class model of ReadWritePropertyMap. It gets updated during the remeshing process while new faces are created.
number_of_relaxation_stepsthe number of iterations of tangential relaxation that are performed at each iteration of the remeshing process
relax_constraintsIf true, the end vertices of the edges set as constrained in edge_is_constrained_map and boundary edges move along the constrained polylines they belong to.
do_projecta boolean that sets whether vertices should be reprojected on the input surface after creation or displacement.
projection_functorA function object used to project input vertices (moved by the smoothing) and created vertices. It must have Point_3 operator()(vertex_descriptor), Point_3 being the value type of the vertex point map. If not provided, vertices are projected on the input surface mesh.
See also
split_long_edges()
Todo:
Deal with exact constructions Kernel. The only thing that makes sense is to guarantee that the output vertices are exactly on the input surface. To do so, we can do every construction in double, and use an exact process for projection. For each vertex, the AABB_tree would be used in an inexact manner to find the triangle on which projection has to be done. Then, use CGAL::intersection(triangle, line) in the exact constructions kernel to get a point which is exactly on the surface.
Examples
Polygon_mesh_processing/corefinement_difference_remeshed.cpp, Polygon_mesh_processing/hausdorff_distance_remeshing_example.cpp, and Polygon_mesh_processing/isotropic_remeshing_example.cpp.

◆ random_perturbation()

template<typename VertexRange , typename TriangleMesh , typename NamedParameters >
void CGAL::Polygon_mesh_processing::random_perturbation ( VertexRange  vertices,
TriangleMesh &  tmesh,
const double &  perturbation_max_size,
const NamedParameters &  np 
)

#include <CGAL/Polygon_mesh_processing/random_perturbation.h>

randomly perturbs the locations of vertices of a triangulated surface mesh. By default, the vertices are re-projected onto the input surface after perturbation. Note that no geometric checks are done after the perturbation (face orientation might become incorrect and self-intersections might be introduced).

Template Parameters
VertexRangemodel of Range, holding vertices of type boost::graph_traits<TriangleMesh>::vertex_descriptor. Its iterator type is ForwardIterator.
TriangleMeshmodel of MutableFaceGraph.
NamedParametersa sequence of Named Parameters
Parameters
verticesthe range of vertices to be perturbed
tmeshthe triangulated surface mesh
perturbation_max_sizethe maximal length of moves that can be applied to vertices of tmesh.
npoptional sequence of Named Parameters among the ones listed below
Named Parameters
geom_traitsa geometric traits class instance, model of Kernel.
vertex_point_mapthe property map with the points associated to the vertices of tmesh. Instance of a class model of ReadWritePropertyMap.
vertex_is_constrained_mapa property map containing the constrained-or-not status of each vertex of tmesh. A constrained vertex cannot be modified at all during perturbation
do_projecta boolean that sets whether vertices are reprojected on the input surface after their coordinates random perturbation
random_seeda non-negative integer value to seed the random number generator, and make the perturbation deterministic

◆ refine()

template<typename TriangleMesh , typename FaceRange , typename FaceOutputIterator , typename VertexOutputIterator , typename NamedParameters >
std::pair<FaceOutputIterator, VertexOutputIterator> CGAL::Polygon_mesh_processing::refine ( TriangleMesh &  tmesh,
const FaceRange &  faces,
FaceOutputIterator  faces_out,
VertexOutputIterator  vertices_out,
const NamedParameters &  np 
)

#include <CGAL/Polygon_mesh_processing/refine.h>

refines a region of a triangle mesh

Template Parameters
TriangleMeshmodel of MutableFaceGraph
FaceRangerange of face descriptors, model of Range. Its iterator type is InputIterator.
FaceOutputIteratormodel of OutputIterator holding boost::graph_traits<TriangleMesh>::face_descriptor for patch faces
VertexOutputIteratormodel of OutputIterator holding boost::graph_traits<TriangleMesh>::vertex_descriptor for patch vertices
NamedParametersa sequence of Named Parameters
Parameters
tmeshtriangle mesh with patches to be refined
facesthe range of faces defining the patches to refine
faces_outoutput iterator into which descriptors of new faces are recorded
vertices_outoutput iterator into which descriptors of new vertices are recorded
npoptional sequence of Named Parameters among the ones listed below
Named Parameters
vertex_point_mapthe property map with the points associated to the vertices of tmesh Instance of a class model of ReadWritePropertyMap. If this parameter is omitted, an internal property map for CGAL::vertex_point_t must be available in TriangleMesh
density_control_factorfactor to control density of the output mesh, where larger values lead to denser refinements. The density of vertices of faces_out is this factor times higher than the vertices of faces.
Returns
pair of faces_out and vertices_out
Precondition
is_triangle_mesh(tmesh)
Todo:
current algorithm iterates 10 times at most, since (I guess) there is no termination proof.
Examples
Polygon_mesh_processing/refine_fair_example.cpp.

◆ smooth_mesh()

template<typename TriangleMesh , typename FaceRange , typename NamedParameters >
void CGAL::Polygon_mesh_processing::smooth_mesh ( const FaceRange &  faces,
TriangleMesh &  tmesh,
const NamedParameters &  np 
)

#include <CGAL/Polygon_mesh_processing/smooth_mesh.h>

smoothes a triangulated region of a polygon mesh.

This function attempts to make the triangle angle and area distributions as uniform as possible by moving (non-constrained) vertices.

Angle-based smoothing does not change the combinatorial information of the mesh. Area-based smoothing might change the combinatorial information, unless specified otherwise. It is also possible to make the smoothing algorithm "safer" by rejecting moves that, when applied, would worsen the quality of the mesh, e.g. that would decrease the value of the smallest angle around a vertex or create self-intersections.

Optionally, the points are reprojected after each iteration.

Template Parameters
TriangleMeshmodel of MutableFaceGraph.
FaceRangerange of boost::graph_traits<TriangleMesh>::face_descriptor, model of Range. Its iterator type is ForwardIterator.
NamedParametersa sequence of Named Parameters
Parameters
tmesha polygon mesh with triangulated surface patches to be smoothed.
facesthe range of triangular faces defining one or several surface patches to be smoothed.
npoptional sequence of Named Parameters among the ones listed below.
Named Parameters
use_angle_smoothingBoolean value to indicate whether angle-based smoothing should be used. Default is true.
use_area_smoothingBoolean value to indicate whether area-based smoothing should be used. Default is true.
number_of_iterationsthe number of iterations for the sequence of the smoothing iterations performed (default is 1).
use_safety_constraintsif true, vertex moves that would worsen the mesh are ignored. Default is false.
use_Delaunay_flipsif true (default value), area-based smoothing will be completed by a phase of Delaunay-based edge-flips to prevent the creation of elongated triangles.
do_projectif true (default value), points are projected onto the initial surface after each iteration.
vertex_is_constrained_mapa property map containing the constrained-or-not status of each vertex of tmesh. A constrained vertex cannot be modified at all during smoothing.
edge_is_constrained_mapa property map, model of ReadWritePropertyMap, containing the constrained-or-not status of each edge of tmesh. A constrained edge cannot be flipped and its extremities are tagged as constrained vertices.
vertex_point_mapthe property map, model of ReadWritePropertyMap, with the points associated to the vertices of tmesh.
geom_traitsa geometric traits class instance, model of Kernel. Exact constructions kernels are not supported by this function.
Warning
The third party library Ceres is required to use area-based smoothing.
Precondition
tmesh does not contain any degenerate faces
Examples
Polygon_mesh_processing/mesh_smoothing_example.cpp.

◆ smooth_shape()

template<typename TriangleMesh , typename FaceRange , typename NamedParameters >
void CGAL::Polygon_mesh_processing::smooth_shape ( const FaceRange &  faces,
TriangleMesh &  tmesh,
const double  time,
const NamedParameters &  np 
)

#include <CGAL/Polygon_mesh_processing/smooth_shape.h>

smooths the overall shape of the mesh by using the mean curvature flow. The effect depends on the curvature of each area and on a time step which represents the amount by which vertices are allowed to move. The result conformally maps the initial surface to a sphere.

Template Parameters
TriangleMeshmodel of MutableFaceGraph.
FaceRangerange of boost::graph_traits<TriangleMesh>::face_descriptor, model of Range. Its iterator type is ForwardIterator.
NamedParametersa sequence of Named Parameters
Parameters
tmesha polygon mesh with triangulated surface patches to be smoothed.
facesthe range of triangular faces defining one or several surface patches to be smoothed.
timea time step that corresponds to the speed by which the surface is smoothed. A larger time step results in faster convergence but details may be distorted to have a larger extent compared to more iterations with a smaller step. Typical values scale in the interval (1e-6, 1].
npoptional sequence of Named Parameters among the ones listed below.
Named Parameters
vertex_point_mapthe property map with the points associated to the vertices of tmesh. Instance of a class model of ReadWritePropertyMap.
geom_traitsa geometric traits class instance, model of Kernel.
vertex_is_constrained_mapa property map containing the constrained-or-not status of each vertex of tmesh. A constrained vertex cannot be modified at all during smoothing.
number_of_iterationsthe number of iterations for the sequence of the smoothing iterations performed. Each iteration is performed with the given time step.
sparse_linear_solveran instance of the sparse linear solver used for smoothing
Warning
This function involves linear algebra, that is computed using a non-exact floating-point arithmetic.
Examples
Polygon_mesh_processing/shape_smoothing_example.cpp.

◆ split_long_edges()

template<typename PolygonMesh , typename EdgeRange , typename NamedParameters >
void CGAL::Polygon_mesh_processing::split_long_edges ( const EdgeRange &  edges,
const double &  max_length,
PolygonMesh &  pmesh,
const NamedParameters &  np 
)

#include <CGAL/Polygon_mesh_processing/remesh.h>

splits the edges listed in edges into sub-edges that are not longer than the given threshold max_length.

Note this function is useful to split constrained edges before calling isotropic_remeshing() with protection of constraints activated (to match the constrained edge length required by the remeshing algorithm to be guaranteed to terminate)

Template Parameters
PolygonMeshmodel of MutableFaceGraph that has an internal property map for CGAL::vertex_point_t.
EdgeRangerange of boost::graph_traits<PolygonMesh>::edge_descriptor, model of Range. Its iterator type is InputIterator.
NamedParametersa sequence of Named Parameters
Parameters
pmesha polygon mesh
edgesthe range of edges to be split if they are longer than given threshold
max_lengththe edge length above which an edge from edges is split into to sub-edges
npoptional Named Parameters, amongst those described below
Named Parameters
vertex_point_mapthe property map with the points associated to the vertices of pmesh. Instance of a class model of ReadWritePropertyMap.
face_index_mapa property map containing the index of each face of pmesh
edge_is_constrained_mapa property map containing the constrained-or-not status of each edge of pmesh. A constrained edge can be split, and the sub-edges are set to be constrained.
See also
isotropic_remeshing()
Examples
Polygon_mesh_processing/isotropic_remeshing_example.cpp.

◆ triangulate_face()

template<typename PolygonMesh , typename NamedParameters >
bool CGAL::Polygon_mesh_processing::triangulate_face ( typename boost::graph_traits< PolygonMesh >::face_descriptor  f,
PolygonMesh &  pmesh,
const NamedParameters &  np 
)

#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>

triangulates a single face of a polygon mesh. This function depends on the package PkgTriangulation2

Template Parameters
PolygonMesha model of FaceListGraph and MutableFaceGraph
NamedParametersa sequence of Named Parameters
Parameters
fface to be triangulated
pmeshthe polygon mesh to which the face to be triangulated belongs
npoptional sequence of Named Parameters among the ones listed below
Named Parameters
vertex_point_mapthe property map with the points associated to the vertices of pmesh. If this parameter is omitted, an internal property map for CGAL::vertex_point_t must be available in PolygonMesh
geom_traitsa geometric traits class instance
Returns
true if the face has been triangulated.

◆ triangulate_faces() [1/2]

template<typename FaceRange , typename PolygonMesh , typename NamedParameters >
bool CGAL::Polygon_mesh_processing::triangulate_faces ( FaceRange  face_range,
PolygonMesh &  pmesh,
const NamedParameters &  np 
)

#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>

triangulates given faces of a polygon mesh. This function depends on the package PkgTriangulation2

Template Parameters
FaceRangerange of boost::graph_traits<PolygonMesh>::face_descriptor, model of Range. Its iterator type is InputIterator.
PolygonMesha model of FaceListGraph and MutableFaceGraph
NamedParametersa sequence of Named Parameters
Parameters
face_rangethe range of faces to be triangulated
pmeshthe polygon mesh to be triangulated
npoptional sequence of Named Parameters among the ones listed below
Named Parameters
vertex_point_mapthe property map with the points associated to the vertices of pmesh. If this parameter is omitted, an internal property map for CGAL::vertex_point_t must be available in PolygonMesh
geom_traitsa geometric traits class instance
Returns
true if all the faces have been triangulated.
See also
triangulate_face()
Examples
Polygon_mesh_processing/locate_example.cpp, and Polygon_mesh_processing/triangulate_faces_example.cpp.

◆ triangulate_faces() [2/2]

template<typename PolygonMesh , typename NamedParameters >
bool CGAL::Polygon_mesh_processing::triangulate_faces ( PolygonMesh &  pmesh,
const NamedParameters &  np 
)

#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>

triangulates all faces of a polygon mesh. This function depends on the package PkgTriangulation2

Template Parameters
PolygonMesha model of FaceListGraph and MutableFaceGraph
NamedParametersa sequence of Named Parameters
Parameters
pmeshthe polygon mesh to be triangulated
npoptional sequence of Named Parameters among the ones listed below
Named Parameters
vertex_point_mapthe property map with the points associated to the vertices of pmesh. If this parameter is omitted, an internal property map for CGAL::vertex_point_t must be available in PolygonMesh
geom_traitsa geometric traits class instance
Returns
true if all the faces have been triangulated.
See also
triangulate_face()