Go to the documentation of this file.
36 #ifndef meshUntangler_H
37 #define meshUntangler_H
void planeCut(const plane &plane)
cut the region woth the plane
DynList< direction, 64 > vertexTypes_
DynList< DynList< label, 8 >, 64 > * facesPtr_
DynList< edge, 128 > * edgesPtr_
void optimizeNodePosition(const scalar tol=0.001)
const DynList< point, 64 > & points() const
return the vertices of the feasible region
void removeCoincidentVertices()
remove coincident vertices to improve tie breaking
Geometric class that creates a 2D plane and can return the intersection point between a line and the ...
void tieBreak(const DynList< label, 8 > &f)
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
class for volume optimizer
void createInitialConfiguration(const boundBox &)
A simplex which is used for smoothing purposes.
DynList< DynList< label, 8 >, 64 > * cFacesPtr_
DynList< label, 128 > newEdgeLabel_
DynList< edge, 128 > * cEdgesPtr_
meshUntangler(partTetMeshSimplex &simplex)
Construct from partTetMeshSimplex.
DynList< point, 64 > * cPtsPtr_
helper data
bool findNewVertices(const plane &plane)
DynList< point, 64 > * pointsPtr_
A bounding box defined in terms of the points at its extremities.
DynList< label, 64 > newVertexLabel_
DynList< scalar, 64 > vertexDistance_
cutRegion(const boundBox &)
Construct from boundBox.
void createPolyMeshFromRegion(polyMeshGen &) const
export the feasible region as polyMeshGen