42 const bool triangulate,
56 const bool triangulate,
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 =
129 const auto edgeAlphaIntersect =
130 [=](
const edge&
e) -> scalar
156 static_cast<Mesh&
>(*this) = rhs;
157 static_cast<plane&
>(*this) = rhs;
virtual label triangulate()
Triangulate in-place, returning the number of triangles added.
A dynamic list of packed unsigned integers, with the number of bits per item specified by the <Width>...
T & first()
Return the first element of the list.
T & last()
Return the last element of the list.
A bitSet stores bits (elements with only two states) in packed internal format and supports a variety...
Description of cuts across cells.
Constructs cutting plane through a mesh.
virtual void performCut(const primitiveMesh &mesh, const bool triangulate, bitSet &&cellIdLabels)
Cut mesh, restricted to a list of cells.
void operator=(const cuttingPlane &rhs)
Copy assignment.
const labelList & meshCells() const
The mesh cells cut.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
Geometric class that creates a 3D plane and can return the intersection point between a line and the ...
scalar lineIntersect(const line< Point, PointRef > &l) const
Return the cutting point between the plane and.
virtual const pointField & points() const
Return raw points.
Cell-face mesh analysis engine.
label nCells() const noexcept
Number of mesh cells.