Optimization

Functions

template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS >
void geometricOptimizeInterior (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, int numSweeps=1)
 Optimize the position of the interior vertices.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimizeInterior (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, int numSweeps=1)
 Make numSweeps optimization sweeps over the given interior vertices with the quality function given as a template parameter.
template<int N, bool A, typename T , typename V , typename IS >
void geometricOptimizeInteriorUsingMeanRatio (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, const int numSweeps=1)
 Optimize the position of the interior vertices.
template<int N, bool A, typename T , typename V , typename IS >
void geometricOptimizeInteriorUsingConditionNumber (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, const int numSweeps=1)
 Optimize the position of the interior vertices.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeBoundary (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, PointsOnManifold< N, N-1, SD, T > *boundaryManifold, int numSweeps=1)
 Optimize the position of all boundary vertices.
template<template< int, typename > class QF, bool A, typename T , typename V , typename IS , typename IntForIter , int SD>
void geometricOptimizeBoundary (IndSimpSetIncAdj< 2, 2, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, PointsOnManifold< 2, 1, SD, T > *boundaryManifold, int numSweeps=1)
 Make numSweeps optimization sweeps over the given boundary vertices with the quality function given as a template parameter.
template<int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeBoundaryUsingMeanRatio (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, PointsOnManifold< N, N-1, SD, T > *boundaryManifold, const int numSweeps=1)
 Optimize the position of all boundary vertices.
template<int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeBoundaryUsingConditionNumber (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, PointsOnManifold< N, N-1, SD, T > *boundaryManifold, const int numSweeps=1)
 Optimize the position of all boundary vertices.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimize (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, PointsOnManifold< N, N-1, SD, T > *boundaryManifold, int numSweeps=1)
 Optimize the position of all vertices.
template<int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeUsingMeanRatio (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, PointsOnManifold< N, N-1, SD, T > *boundaryManifold, const int numSweeps=1)
 Optimize the position of all vertices.
template<int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeUsingConditionNumber (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, PointsOnManifold< N, N-1, SD, T > *boundaryManifold, const int numSweeps=1)
 Optimize the position of all vertices.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeWithBoundaryCondition (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, PointsOnManifold< N, N-1, SD, T > *boundaryManifold, int numSweeps=1)
 Optimize the position of all vertices.
template<int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeWithBoundaryConditionUsingMeanRatio (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, PointsOnManifold< N, N-1, SD, T > *boundaryManifold, const int numSweeps=1)
 Optimize the position of all vertices.
template<int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeWithBoundaryConditionUsingConditionNumber (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, PointsOnManifold< N, N-1, SD, T > *boundaryManifold, const int numSweeps=1)
 Optimize the position of all vertices.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , class BoundaryCondition >
void geometricOptimizeWithCondition (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, const BoundaryCondition &condition, int numSweeps=1)
 Optimize the position of all vertices.
template<int N, bool A, typename T , typename V , typename IS , class BoundaryCondition >
void geometricOptimizeWithConditionUsingMeanRatio (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, const BoundaryCondition &condition, const int numSweeps=1)
 Optimize the position of all vertices.
template<int N, bool A, typename T , typename V , typename IS , class BoundaryCondition >
void geometricOptimizeWithConditionUsingConditionNumber (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, const BoundaryCondition &condition, const int numSweeps=1)
 Optimize the position of all vertices.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS >
void geometricOptimize (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, const int numSweeps=1)
 Optimize the position of all vertices.
template<int N, bool A, typename T , typename V , typename IS >
void geometricOptimizeUsingMeanRatio (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, const int numSweeps=1)
 Optimize the position of all vertices.
template<int N, bool A, typename T , typename V , typename IS >
void geometricOptimizeUsingConditionNumber (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, const int numSweeps=1)
 Optimize the position of all vertices.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , typename IntForIter , int SD>
void geometricOptimizeWithBoundaryCondition (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, PointsOnManifold< N, N-1, SD, T > *boundaryManifold, int numSweeps=1)
 Make numSweeps optimization sweeps over the given vertices with the quality function given as a template parameter.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter , int SD>
void geometricOptimizeWithBoundaryConditionUsingMeanRatio (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, PointsOnManifold< N, N-1, SD, T > *boundaryManifold, const int numSweeps=1)
 Optimize the position of a set of vertices.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter , int SD>
void geometricOptimizeWithBoundaryConditionUsingConditionNumber (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, PointsOnManifold< N, N-1, SD, T > *boundaryManifold, const int numSweeps=1)
 Optimize the position of a set of vertices.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , typename IntForIter , class BoundaryCondition >
void geometricOptimizeWithCondition (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, const BoundaryCondition &condition, int numSweeps=1)
 Make numSweeps optimization sweeps over the given vertices with the quality function given as a template parameter.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter , class BoundaryCondition >
void geometricOptimizeWithConditionUsingMeanRatio (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, const BoundaryCondition &condition, int numSweeps=1)
 Optimize the position of a set of vertices.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter , class BoundaryCondition >
void geometricOptimizeWithConditionUsingConditionNumber (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, const BoundaryCondition &condition, const int numSweeps=1)
 Optimize the position of a set of vertices.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimize (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, const int numSweeps=1)
 Make numSweeps optimization sweeps over the given vertices with the quality function given as a template parameter.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimizeUsingMeanRatio (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, const int numSweeps=1)
 Optimize the position of a set of vertices.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimizeUsingConditionNumber (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, const int numSweeps=1)
 Optimize the position of a set of vertices.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , typename IntForIter , class BoundaryCondition >
void geometricOptimizeWithConditionConstrained (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, const BoundaryCondition &condition, const T maxConstraintError, int numSweeps=1)
 Make numSweeps constrained optimization sweeps over the given vertices with the quality function given as a template parameter.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter , class BoundaryCondition >
void geometricOptimizeWithConditionConstrainedUsingMeanRatio (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, const BoundaryCondition &condition, const T maxConstraintError, int numSweeps=1)
 Optimize the position of a set of vertices subject to a constant content constraint.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter , class BoundaryCondition >
void geometricOptimizeWithConditionConstrainedUsingConditionNumber (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, const BoundaryCondition &condition, const T maxConstraintError, const int numSweeps=1)
 Optimize the position of a set of vertices subject to a constant content constraint.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimizeConstrained (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, const T maxConstraintError, const int numSweeps=1)
 Make numSweeps constrained optimization sweeps over the given vertices with the quality function given as a template parameter.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimizeConstrainedUsingMeanRatio (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, const T maxConstraintError, const int numSweeps=1)
 Optimize the position of a set of vertices subject to a constant content constraint.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimizeConstrainedUsingConditionNumber (IndSimpSetIncAdj< N, N, A, T, V, IS > *mesh, IntForIter begin, IntForIter end, const T maxConstraintError, const int numSweeps=1)
 Optimize the position of a set of vertices subject to a constant content constraint.

Detailed Description

These functions perform geometric optimization of vertex positions. One can sweep over all vertices or a set of vertices. One can apply either unconstrained optimization or optimization subject to a constant content constraint.


Function Documentation

template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimize ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
const int  numSweeps = 1 
) [inline]

Make numSweeps optimization sweeps over the given vertices with the quality function given as a template parameter.

QF is a simplex quality functor. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS >
void geometricOptimize ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
const int  numSweeps = 1 
) [inline]

Optimize the position of all vertices.

Make numSweeps optimization sweeps over the vertices with the specified quality function.

Parameters:
mesh is the indexed simplex set.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimize ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
PointsOnManifold< N, N-1, SD, T > *  boundaryManifold,
int  numSweeps = 1 
) [inline]

Optimize the position of all vertices.

Make numSweeps optimization sweeps over the boundary vertices with the specified quality function.

Parameters:
mesh is the indexed simplex set.
boundaryManifold is the boundary manifold. If specified (nonzero), the boundary vertices will be optimized. If not, they will not be altered.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<template< int, typename > class QF, bool A, typename T , typename V , typename IS , typename IntForIter , int SD>
void geometricOptimizeBoundary ( IndSimpSetIncAdj< 2, 2, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
PointsOnManifold< 2, 1, SD, T > *  boundaryManifold,
int  numSweeps = 1 
) [inline]

Make numSweeps optimization sweeps over the given boundary vertices with the quality function given as a template parameter.

QF is a simplex quality functor. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
boundaryManifold is the boundary manifold.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeBoundary ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
PointsOnManifold< N, N-1, SD, T > *  boundaryManifold,
int  numSweeps = 1 
) [inline]

Optimize the position of all boundary vertices.

Make numSweeps optimization sweeps over the boundary vertices with the specified quality function.

Parameters:
mesh is the indexed simplex set.
boundaryManifold is the boundary manifold.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeBoundaryUsingConditionNumber ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
PointsOnManifold< N, N-1, SD, T > *  boundaryManifold,
const int  numSweeps = 1 
) [inline]

Optimize the position of all boundary vertices.

Make numSweeps optimization sweeps over the vertices with the modified condition number quality function.

Parameters:
mesh is the indexed simplex set.
boundaryManifold is the boundary manifold.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeBoundaryUsingMeanRatio ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
PointsOnManifold< N, N-1, SD, T > *  boundaryManifold,
const int  numSweeps = 1 
) [inline]

Optimize the position of all boundary vertices.

Make numSweeps optimization sweeps over the vertices with the modified mean ratio quality function.

Parameters:
mesh is the indexed simplex set.
boundaryManifold is the boundary manifold.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimizeConstrained ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
const T  maxConstraintError,
const int  numSweeps = 1 
) [inline]

Make numSweeps constrained optimization sweeps over the given vertices with the quality function given as a template parameter.

QF is a simplex quality functor. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
maxConstraintError is the maximum allowed constraint error.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimizeConstrainedUsingConditionNumber ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
const T  maxConstraintError,
const int  numSweeps = 1 
) [inline]

Optimize the position of a set of vertices subject to a constant content constraint.

Make numSweeps optimization sweeps over the given vertices with the modified condition number quality function. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
maxConstraintError is the maximum allowed constraint error.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimizeConstrainedUsingMeanRatio ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
const T  maxConstraintError,
const int  numSweeps = 1 
) [inline]

Optimize the position of a set of vertices subject to a constant content constraint.

Make numSweeps optimization sweeps over the given vertices with the modified mean ratio quality function. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
maxConstraintError is the maximum allowed constraint error.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimizeInterior ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
int  numSweeps = 1 
) [inline]

Make numSweeps optimization sweeps over the given interior vertices with the quality function given as a template parameter.

QF is a simplex quality functor. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS >
void geometricOptimizeInterior ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
int  numSweeps = 1 
) [inline]

Optimize the position of the interior vertices.

Make numSweeps optimization sweeps over the interior vertices with the specified quality function.

Parameters:
mesh is the indexed simplex set.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS >
void geometricOptimizeInteriorUsingConditionNumber ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
const int  numSweeps = 1 
) [inline]

Optimize the position of the interior vertices.

Make numSweeps optimization sweeps over the interior vertices with the modified condition number quality function.

Parameters:
mesh is the indexed simplex set.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS >
void geometricOptimizeInteriorUsingMeanRatio ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
const int  numSweeps = 1 
) [inline]

Optimize the position of the interior vertices.

Make numSweeps optimization sweeps over the interior vertices with the modified mean ratio quality function.

Parameters:
mesh is the indexed simplex set.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimizeUsingConditionNumber ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
const int  numSweeps = 1 
) [inline]

Optimize the position of a set of vertices.

Make numSweeps optimization sweeps over the given vertices with the modified condition number quality function. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS >
void geometricOptimizeUsingConditionNumber ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
const int  numSweeps = 1 
) [inline]

Optimize the position of all vertices.

Make numSweeps optimization sweeps over the vertices with the modified condition number quality function.

Parameters:
mesh is the indexed simplex set.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeUsingConditionNumber ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
PointsOnManifold< N, N-1, SD, T > *  boundaryManifold,
const int  numSweeps = 1 
) [inline]

Optimize the position of all vertices.

Make numSweeps optimization sweeps over the vertices with the modified condition number quality function.

Parameters:
mesh is the indexed simplex set.
boundaryManifold is the boundary manifold. If specified (nonzero), the boundary vertices will be optimized. If not, they will not be altered.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter >
void geometricOptimizeUsingMeanRatio ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
const int  numSweeps = 1 
) [inline]

Optimize the position of a set of vertices.

Make numSweeps optimization sweeps over the given vertices with the modified mean ratio quality function. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS >
void geometricOptimizeUsingMeanRatio ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
const int  numSweeps = 1 
) [inline]

Optimize the position of all vertices.

Make numSweeps optimization sweeps over the vertices with the modified mean ratio quality function.

Parameters:
mesh is the indexed simplex set.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeUsingMeanRatio ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
PointsOnManifold< N, N-1, SD, T > *  boundaryManifold,
const int  numSweeps = 1 
) [inline]

Optimize the position of all vertices.

Make numSweeps optimization sweeps over the vertices with the modified mean ratio quality function.

Parameters:
mesh is the indexed simplex set.
boundaryManifold is the boundary manifold. If specified (nonzero), the boundary vertices will be optimized. If not, they will not be altered.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , typename IntForIter , int SD>
void geometricOptimizeWithBoundaryCondition ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
PointsOnManifold< N, N-1, SD, T > *  boundaryManifold,
int  numSweeps = 1 
) [inline]

Make numSweeps optimization sweeps over the given vertices with the quality function given as a template parameter.

QF is a simplex quality functor. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
boundaryManifold is the boundary manifold.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeWithBoundaryCondition ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
PointsOnManifold< N, N-1, SD, T > *  boundaryManifold,
int  numSweeps = 1 
) [inline]

Optimize the position of all vertices.

Make numSweeps optimization sweeps over the vertices with the specified quality function.

Parameters:
mesh is the indexed simplex set.
boundaryManifold is the boundary manifold.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter , int SD>
void geometricOptimizeWithBoundaryConditionUsingConditionNumber ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
PointsOnManifold< N, N-1, SD, T > *  boundaryManifold,
const int  numSweeps = 1 
) [inline]

Optimize the position of a set of vertices.

Make numSweeps optimization sweeps over the given vertices with the modified mean ratio quality function. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
boundaryManifold The boundary manifold.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeWithBoundaryConditionUsingConditionNumber ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
PointsOnManifold< N, N-1, SD, T > *  boundaryManifold,
const int  numSweeps = 1 
) [inline]

Optimize the position of all vertices.

Make numSweeps optimization sweeps over the vertices with the modified condition number quality function.

Parameters:
mesh is the indexed simplex set.
boundaryManifold is the boundary manifold.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter , int SD>
void geometricOptimizeWithBoundaryConditionUsingMeanRatio ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
PointsOnManifold< N, N-1, SD, T > *  boundaryManifold,
const int  numSweeps = 1 
) [inline]

Optimize the position of a set of vertices.

Make numSweeps optimization sweeps over the given vertices with the modified mean ratio quality function. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
boundaryManifold The boundary manifold.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , int SD>
void geometricOptimizeWithBoundaryConditionUsingMeanRatio ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
PointsOnManifold< N, N-1, SD, T > *  boundaryManifold,
const int  numSweeps = 1 
) [inline]

Optimize the position of all vertices.

Make numSweeps optimization sweeps over the vertices with the modified mean ratio quality function.

Parameters:
mesh is the indexed simplex set.
boundaryManifold is the boundary manifold.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , typename IntForIter , class BoundaryCondition >
void geometricOptimizeWithCondition ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
const BoundaryCondition &  condition,
int  numSweeps = 1 
) [inline]

Make numSweeps optimization sweeps over the given vertices with the quality function given as a template parameter.

QF is a simplex quality functor. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
condition is a transformation that is applied after the optimization.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , class BoundaryCondition >
void geometricOptimizeWithCondition ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
const BoundaryCondition &  condition,
int  numSweeps = 1 
) [inline]

Optimize the position of all vertices.

Make numSweeps optimization sweeps over the vertices with the specified quality function.

Parameters:
mesh is the indexed simplex set.
condition is a transformation that is applied after the optimization.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<template< int, typename > class QF, int N, bool A, typename T , typename V , typename IS , typename IntForIter , class BoundaryCondition >
void geometricOptimizeWithConditionConstrained ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
const BoundaryCondition &  condition,
const T  maxConstraintError,
int  numSweeps = 1 
) [inline]

Make numSweeps constrained optimization sweeps over the given vertices with the quality function given as a template parameter.

QF is a simplex quality functor. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
condition is a transformation that is applied after the optimization.
maxConstraintError is the maximum allowed constraint error.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter , class BoundaryCondition >
void geometricOptimizeWithConditionConstrainedUsingConditionNumber ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
const BoundaryCondition &  condition,
const T  maxConstraintError,
const int  numSweeps = 1 
) [inline]

Optimize the position of a set of vertices subject to a constant content constraint.

Make numSweeps optimization sweeps over the given vertices with the modified condition number quality function. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
condition is a transformation that is applied after the optimization.
maxConstraintError is the maximum allowed constraint error.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter , class BoundaryCondition >
void geometricOptimizeWithConditionConstrainedUsingMeanRatio ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
const BoundaryCondition &  condition,
const T  maxConstraintError,
int  numSweeps = 1 
) [inline]

Optimize the position of a set of vertices subject to a constant content constraint.

Make numSweeps optimization sweeps over the given vertices with the modified mean ratio quality function. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
condition is a transformation that is applied after the optimization.
maxConstraintError is the maximum allowed constraint error.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter , class BoundaryCondition >
void geometricOptimizeWithConditionUsingConditionNumber ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
const BoundaryCondition &  condition,
const int  numSweeps = 1 
) [inline]

Optimize the position of a set of vertices.

Make numSweeps optimization sweeps over the given vertices with the modified condition number quality function. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
condition is a transformation that is applied after the optimization.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , class BoundaryCondition >
void geometricOptimizeWithConditionUsingConditionNumber ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
const BoundaryCondition &  condition,
const int  numSweeps = 1 
) [inline]

Optimize the position of all vertices.

Make numSweeps optimization sweeps over the vertices with the modified condition number quality function.

Parameters:
mesh is the indexed simplex set.
condition is a transformation that is applied after the optimization.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , typename IntForIter , class BoundaryCondition >
void geometricOptimizeWithConditionUsingMeanRatio ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
IntForIter  begin,
IntForIter  end,
const BoundaryCondition &  condition,
int  numSweeps = 1 
) [inline]

Optimize the position of a set of vertices.

Make numSweeps optimization sweeps over the given vertices with the modified mean ratio quality function. IntForIter is a const iterator on vertex indices.

Parameters:
mesh is the indexed simplex set.
begin is the beginning of the vertex indices.
end is the end of the vertex indices.
condition is a transformation that is applied after the optimization.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
template<int N, bool A, typename T , typename V , typename IS , class BoundaryCondition >
void geometricOptimizeWithConditionUsingMeanRatio ( IndSimpSetIncAdj< N, N, A, T, V, IS > *  mesh,
const BoundaryCondition &  condition,
const int  numSweeps = 1 
) [inline]

Optimize the position of all vertices.

Make numSweeps optimization sweeps over the vertices with the modified mean ratio quality function.

Parameters:
mesh is the indexed simplex set.
condition is a transformation that is applied after the optimization.
numSweeps is the number of sweeps performed over the vertices. By default it is 1.
Generated on Thu Jun 30 02:14:58 2016 for Computational Geometry Package by  doxygen 1.6.3