Positioning of computational nodes
Although the meshless methods do not require any topological relations between nodes and even randomly distributed nodes could be used, it is well-known that using regularly distributed nodes leads to more accurate and more stable results. So despite meshless seeming robustness regarding the nodal distribution, a certain effort has to be invested into the positioning of the nodes and following discussion, to some extent, deals with this problem. In a following discussion we want to form set of algorithms that can cover arbitrary domain in n dimensions with nodes that can be further used to solve systems of PDEs. We start with algorithms for filling the domain with nodes. Second set is denoted to improving the nodal distributions and a last set of algorithms deals with the refinement of the nodal distribution. The algorithms can of course be combined.
Filling the domain with nodes
The goal is to fill arbitrary domain, which we can ask if position $\b{p}$ is in the domain our outside, with nodes following the given target density function $\rho(\b{p})$.
We start with a simple algorithm based on Poisson Disk Sampling that results in a relatively tightly packed distribution of nodes. What we do is:
- Randomly select a node within the domain.
- Add N (depending on the dimensionality of the space) on circle/sphere around that node.
- Randomly select one of just added nodes and repeat adding.
- Each time check if any of new nodes violates minimal distance criterion, i.e. if it is positioned to close to any of the existing nodes.
