Navigation
API > API/Plugins > API/Plugins/DynamicMesh > API/Plugins/DynamicMesh/Solvers
References
| Module | DynamicMesh |
| Header | /Engine/Plugins/Runtime/GeometryProcessing/Source/DynamicMesh/Public/Solvers/LaplacianMatrixAssembly.h |
| Include | #include "Solvers/LaplacianMatrixAssembly.h" |
namespace UE
{
namespace MeshDeformation
{
template<typename RealType>
void UE&58;&58;MeshDeformation&58;&58;ConstructMeanValueWeightLaplacian
&40;
const FDynamicMesh3 & DynamicMesh,
const FVertexLinearization & VertexMap,
UE::Solvers::TSparseMatrixAssembler< RealType > & LaplacianInterior,
UE::Solvers::TSparseMatrixAssembler< RealType > & LaplacianBoundary
&41;
}
}
Remarks
Construct a sparse matrix representation using a meanvalue-weighted Laplacian. NB: there is no reason to expect this to be a symmetric matrix.
The mesh itself is assumed to have N interior vertices, and M boundary vertices.
LaplacianInterior * Vector_InteriorVerts + LaplacianBoundary * Vector_BoundaryVerts = Full Laplacian applied to interior vertices.
Parameters
| Name | Description |
|---|---|
| DynamicMesh | The triangle mesh |
| VertexMap | Additional arrays used to map between vertexID and offset in a linear array (i.e. the row). The vertices are ordered so that last M ( = VertexMap.NumBoundaryVerts() ) correspond to those on the boundary. |
| LaplacianInterior | On return, the laplacian operator that acts on the interior vertices: sparse N x N matrix |
| LaplacianBoundary | On return, the portion of the operator that acts on the boundary vertices: sparse N x M matrix |