ENH: Adds mesh data memory layout optimizer
Adds optimizer to the mesh. This algorithm rewires the node order and triangle connectivity to optimize for memory layout. Adds tests for the same. The algorithm starts with a random node and flood-fills in the triangular mesh space adds nodes and elements at every iteration. The iteration ends when the surface is "flooded". The algorithm assumes that the mesh is one topologically connected entity. TODO: Further optimization at each iteration. Extend to other mesh types.
Showing
- Base/Geometry/Mesh/imstkMesh.cpp 3 additions, 3 deletionsBase/Geometry/Mesh/imstkMesh.cpp
- Base/Geometry/Mesh/imstkMesh.h 1 addition, 2 deletionsBase/Geometry/Mesh/imstkMesh.h
- Base/Geometry/Mesh/imstkSurfaceMesh.cpp 122 additions, 1 deletionBase/Geometry/Mesh/imstkSurfaceMesh.cpp
- Base/Geometry/Mesh/imstkSurfaceMesh.h 13 additions, 0 deletionsBase/Geometry/Mesh/imstkSurfaceMesh.h
- Base/Geometry/Mesh/imstkTetrahedralMesh.cpp 1 addition, 1 deletionBase/Geometry/Mesh/imstkTetrahedralMesh.cpp
- Examples/Sandbox/main.cpp 60 additions, 2 deletionsExamples/Sandbox/main.cpp
Loading
Please register or sign in to comment