/Engine/Source/Runtime/GeometryCore/Public/Generators/MarchingCubes.h
class FMarchingCubes : public [UE::Geometry::FMeshShapeGenerator](API\Runtime\GeometryCore\Generators\FMeshShapeGenerator)
bool
bEnableValueCaching
If true, code will assume thatImplicit()is expensive enough that it is worth it to cache evaluations when possible.
FBlockedDenseGr...
BlockedCornerValuesGrid
Store corner values in pre-allocated grid that has FMathf::MaxReal as sentinel.
FBlockedDenseGr...
BlockedDoneCells
TAxisAlignedBox...
Bounds
Bounding-box we will mesh inside of.
bool
bParallelCompute
Use multi-threading? Generally a good idea unless problem is very small or you are multi-threading at a higher level (which may be more efficient)
TFunction< bool...
CancelF
If this function returns true, we should abort calculation
FVector3i
CellDimensions
Cube indices range from [Origin,CellDimensions)
double
CubeSize
Length of edges of cubes that are marching.
const int64
EDGE_X
const int64
EDGE_Y
const int64
EDGE_Z
TArray< FCritic...
EdgeVertexSectionLocks
TArray<TMap< i...
EdgeVertexSections
FAxisAlignedBox...
GridBounds
TFunction< doub...
Implicit
This is the function we will evaluate
double
IsoValue
Mesh surface will be at this isovalue.
FAxisAlignedBox...
LastGridBounds
const int64
NumEdgeVertexSections
Hash table for edge vertices
int64
NumTriangleSections
int64
NumVertexSections
bool
parallel_mesh_access
ERootfindingMod...
RootMode
Which rootfinding method will be used to converge on surface along edges
int
RootModeSteps
Number of iterations of rootfinding method (ignored for SingleLerp)
int
SafetyMaxDimension
Max number of cells on any dimension; if exceeded, CubeSize will be automatically increased to fix
TArray<TArray<...
TriangleSectionLists
TArray< FCritic...
TriangleSectionLocks
std::atomic< in...
VertexCounter
TArray<TArray<...
VertexSectionLists
TArray< FCritic...
VertexSectionLocks