\( \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 4.10.1 - Planar Parameterization of Triangulated Surface Meshes
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Triangulated Surface Mesh Parameterization Reference

bimbaDetail.png
Laurent Saboret, Pierre Alliez and Bruno Lévy
Parameterizing a surface amounts to finding a one-to-one mapping from a suitable domain to the surface. In this package, we focus on triangulated surfaces that are homeomorphic to a disk and on piecewise linear mappings into a planar domain. This package implements several surface mesh parameterization methods, such as least squares conformal maps, discrete conformal map, discrete authalic parameterization, Floater mean value coordinates or Tutte barycentric mapping.


Introduced in: CGAL 3.2
Depends on: CGAL and Solvers
BibTeX: cgal:sal-pptsm2-17b
License: GPL
Windows Demo: Polyhedron demo
Common Demo Dlls: dlls

Classified Reference Pages

Main Function

Concepts

Surface Parameterization Methods

This CGAL package implements several parameterization methods:

Border Parameterization Methods

Border parameterization methods define a set of constraints (a constraint specifies two (u,v) coordinates for each instance of a vertex along the border).

This package implements all common border parameterization methods:

Mesh

The general definition of input meshes handled directly by CGAL::parameterize() is:

This package provides a model of the ParameterizationMesh_3 concept to access CGAL::Polyhedron_3<Traits>:

The meshes supported indirectly by the package can be of any genus and have any number of connected components. If it is not a topological disc, the input mesh has to come with a description of a cutting path (an oriented list of vertices) which is the border of a topological disc. If no cutting path is given as input, we assume that the surface border is the longest border already in the input mesh (the other borders will be considered as holes).

The CGAL::Parameterization_mesh_patch_3<ParameterizationPatchableMesh_3> class is responsible for virtually cutting a patch in a ParameterizationPatchableMesh_3 mesh. The resulting patch is a topological disk (if the input cutting path is correct) and provides a ParameterizationMesh_3 interface. It can be used as parameter of CGAL::parameterize().

Note that this way the user is responsible for cutting a closed mesh of arbitrary genus (even a topological disc with an intricate seam cut), as long as this condition is fulfilled.

The package provides an interface with CGAL::Polyhedron_3<Traits>:

Output

A (u,v) pair is computed for each inner vertex (i.e. its halfedges share the same (u,v) pair), while a (u,v) pair is computed for each border halfedge. The user must iterate over the mesh halfedges to get the result.

Helper Classes

Checks and Assertions

The package performs the next checks:

For fixed border parameterizations:

For free border parameterizations:

Assertions are optional checks. The assertion flags for the package use SURFACE_MESH_PARAMETERIZATION in their names (e.g. CGAL_SURFACE_MESH_PARAMETERIZATION_NO_ASSERTIONS).

Modules

 Main Function
 
 Concepts
 
 Surface Parameterization Methods
 This CGAL package implements several parameterization methods:
 
 Border Parameterization Methods
 Border parameterization methods define a set of constraints (a constraint specifies two (u,v) coordinates for each instance of a vertex along the border).
 
 Mesh
 The general definition of input meshes handled directly by CGAL::parameterize() is:
 
 Helper Class