Dear Hassan,
Everything is described there:
https://arxiv.org/abs/2106.09576
The algorithm is pretty simple. For every cell, we find the list of
possible neighbours. We define this list by looking at every cell which
shares a vertex with a cell we are presently working with. For all
particles,
Dear Bruno
That is what I am looking for. Surely its good to have them in deal.II.
Otherwise, could you please describe shortly the algorithm that you used to
do that.
Thanks,
Hassan
On Sunday, February 13, 2022 at 6:21:42 PM UTC+3:30 blais...@gmail.com
wrote:
> Dear Hassan,
> There is no
Dear Hassan,
There is no way to do that directly in Deal.II
Lethe adds two classes to achieve this using a coarse and then a fine
contact detection.
https://github.com/lethe-cfd/lethe/blob/master/include/dem/particle_particle_broad_search.h
https://github.com/lethe-cfd/lethe/blob/master/include/de
Dear Wolfgang and Bruno
thank you for your answers. I will study the 'lethe' code.
I want to apply constraints on linear momentum for a set of particles.
Actually, I want to build an SPH code from scratch. We are working with a
total Lagrangian formulation, so position of particles is constant
If I may suggest, at that point, I would ask you what you are trying to
specifically achieve?
If you want to build an SPH code from scratch, this is definitely possible
to do using deal.II particle classes (esp. with the exchange and update
ghosts functionalities), but this will require a lot of
