\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 5.0.4 - CGAL and the Boost Graph Library

Methods to split a mesh into subdomains, using the library METIS.

Functions

template<typename TriangleMesh , typename NamedParameters >
void CGAL::METIS::partition_graph (const TriangleMesh &tm, int nparts, const NamedParameters &np)
 Computes a partition of the input triangular mesh into nparts parts, based on the mesh's nodal graph. More...
 
template<typename TriangleMesh , typename NamedParameters >
void CGAL::METIS::partition_dual_graph (const TriangleMesh &tm, int nparts, const NamedParameters &np)
 Computes a partition of the input triangular mesh into nparts parts, based on the mesh's dual graph. More...
 

Function Documentation

◆ partition_dual_graph()

template<typename TriangleMesh , typename NamedParameters >
void CGAL::METIS::partition_dual_graph ( const TriangleMesh &  tm,
int  nparts,
const NamedParameters &  np 
)

#include <CGAL/boost/graph/METIS/partition_dual_graph.h>

Computes a partition of the input triangular mesh into nparts parts, based on the mesh's dual graph.

The resulting partition is stored in the vertex and/or face property maps that are passed as parameters using Named Parameters.

Property map for CGAL::vertex_index_t should be either available as an internal property map to tm or provided as Named Parameters.

Parameters
tma triangle mesh
npartsthe number of parts in the final partition
npoptional Named Parameters described below
Template Parameters
TriangleMeshis a model of the FaceListGraph concept.
NamedParametersa sequence of Named Parameters
Named Parameters
vertex_index_mapis a property map containing the index of each vertex of tm intialized from 0 to num_vertices(tm)-1.
METIS_optionsis a parameter used in to pass options to the METIS mesh partitioner. The many options of METIS are not described here. Instead, users should refer to the documentation of METIS directly.
vertex_partition_id_mapis a property map that contains (after the function has been run) the ID of the subpart for each vertex of tm.
face_partition_id_mapis a property map that contains (after the function has been run) the ID of the subpart for each face of tm.
Precondition
tm is a pure triangular surface mesh: there are no edges without at least one incident face
Examples:
BGL_surface_mesh/surface_mesh_partition.cpp.

◆ partition_graph()

template<typename TriangleMesh , typename NamedParameters >
void CGAL::METIS::partition_graph ( const TriangleMesh &  tm,
int  nparts,
const NamedParameters &  np 
)

#include <CGAL/boost/graph/METIS/partition_graph.h>

Computes a partition of the input triangular mesh into nparts parts, based on the mesh's nodal graph.

The resulting partition is stored in the vertex and/or face property maps that are passed as parameters using Named Parameters.

Property map for CGAL::vertex_index_t should be either available as an internal property map to tm or provided as Named Parameters.

Parameters
tma triangle mesh
npartsthe number of parts in the final partition
npoptional Named Parameters described below
Template Parameters
TriangleMeshis a model of the FaceListGraph concept.
NamedParametersa sequence of Named Parameters
Named Parameters
vertex_index_mapis a property map containing the index of each vertex of tm intialized from 0 to num_vertices(tm)-1.
METIS_optionsis a parameter used in to pass options to the METIS mesh partitioner. The many options of METIS are not described here. Instead, users should refer to the documentation of METIS directly.
vertex_partition_id_mapis a property map that contains (after the function has been run) the ID of the subpart for each vertex of tm.
face_partition_id_mapis a property map that contains (after the function has been run) the ID of the subpart for each face of tm.
Precondition
tm is a pure triangular surface mesh: there are no edges without at least one incident face
Examples:
BGL_polyhedron_3/polyhedron_partition.cpp.