42 const bool triangulate,
48 performCut(
mesh, triangulate, cellIdLabels);
56 const bool triangulate,
62 performCut(
mesh, triangulate, cellIdLabels);
70 const bool triangulate,
85 const bool triangulate,
89 const plane& pln = *
this;
108 const label nFaceCuts = calcCellCuts(
mesh, sides, cellCuts);
116 const auto edgeOrientIntersect =
119 if (sides[
e.last()] < sides[
e.first()])
124 return sides[
e.first()] != sides[
e.last()];
129 const auto edgeAlphaIntersect =
130 [=](
const edge&
e) -> scalar
156 static_cast<Mesh&
>(*this) = rhs;
157 static_cast<plane&
>(*this) = rhs;
virtual void performCut(const primitiveMesh &mesh, const bool triangulate, bitSet &&cellIdLabels)
Cut mesh, restricted to a list of cells.
cuttingPlane(const plane &pln)
Construct from a plane description without any cutting.
Cell-face mesh analysis engine.
Geometric class that creates a 3D plane and can return the intersection point between a line and the ...
Description of cuts across cells.
scalar lineIntersect(const line< PointType, PointRef > &l) const
Return the cutting point between the plane and a line passing through the supplied points...
virtual const pointField & points() const
Return raw points.
const dimensionedScalar e
Elementary charge.
Constructs cutting plane through a mesh.
virtual label triangulate()
Triangulate in-place, returning the number of triangles added.
const labelList & meshCells() const
The mesh cells cut.
A bitSet stores bits (elements with only two states) in packed internal format and supports a variety...
void operator=(const cuttingPlane &rhs)
Copy assignment.
label nCells() const noexcept
Number of mesh cells.