CGAL 4.7 - Planar Parameterization of Triangulated Surface Meshes: Reference Manual

\( \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.7 - Planar Parameterization of Triangulated Surface Meshes

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Reference Manual
Here is a list of all modules:
[detail level 12]

Planar Parameterization of Triangulated Surface Meshes Reference |
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:
Sparse Linear Algebra | Since parameterizing meshes requires efficient representation of sparse matrices and efficient iterative or direct linear solvers, we provide an interface to several sparse linear solvers:
Helper Class |