Simulate with complex geometries and complex physics
GeometryBased
Exclude critical neighbors based on the given, triangulated geometry
1.) The picture shows the exclusion algorithm based on the geometry.
IF the segment between two MESHFREE points passes through one of the given boundary triangles, then they are excluded as neighbors.
See the picture below.
2.) Due to high computational effort, the method above might come with a very fine triangular resolution of the boundary,
recently this algorithm switched to an approximative version. Here, all boundary points form discs about
their particular position and the given normal. The radius of the disc is 0.3*SmoothingLength.
The collection of discs forms an approximation of the given rigid boundary. See the picture below.
Two MESHFREE points are excluded as neighbors, IF their connecting segment passes through one such disc.
Both algorithms shown here might lead to the situation, that we exclude too many neighbors from each other, especially at convex boundaries.
A solution to this dilemma is given by the ReplugNeighbors algorithm.
See NEIGHBOR_FilterMethod in particular.
2.) Due to high computational effort, the method above might come with a very fine triangular resolution of the boundary,
recently this algorithm switched to an approximative version. Here, all boundary points form discs about
their particular position and the given normal. The radius of the disc is 0.3*SmoothingLength.
The collection of discs forms an approximation of the given rigid boundary. See the picture below.
Two MESHFREE points are excluded as neighbors, IF their connecting segment passes through one such disc.
Both algorithms shown here might lead to the situation, that we exclude too many neighbors from each other, especially at convex boundaries.
A solution to this dilemma is given by the ReplugNeighbors algorithm.
See NEIGHBOR_FilterMethod in particular.