Go to the documentation of this file.
74 const scalar scale = 1.0 /
bb_.
mag();
87 if( funcAfter >
func )
scalar mag() const
The magnitude of the bounding box span.
scalar optimiseSteepestDescent(const scalar tol)
optimise using the steepest descent
const point & max() const
Maximum describing the bounding box.
#define forAll(list, i)
Loop across all elements in list.
Template functions to aid in the implementation of demand driven data.
class for volume optimizer
DynList< point, 128 > & points_
mesh points
void func(FieldField< Field, Type > &f, const FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
const point & min() const
Minimum describing the bounding box.
const label pointI_
label of the point
void optimizeNodePosition(const scalar tol=0.001)
find the best position for the node
static const vector dirVecs[8]
direction vectors for divide and conquer algorithm
Vector< scalar > vector
A scalar version of the templated Vector.
volumeOptimizer(partTetMeshSimplex &simplex)
construct from partTetMeshSimplex
bool contains(const point &) const
Contains point? (inside or on edge)
scalar optimiseDivideAndConquer(const scalar tol)
optimize position using a divide and conquer algorithm