Is there any way to find element neighbors with in a particular *radius* from its center? One approach is to compare distance with every other element in the whole mesh but then the algorithmic complexity will be O(N^2). Another approach is to map all the elements to a coarse structured grid with h=*radius *and assign each element a cell number of this structured grid. Then I know what are the neighbors of an element which lie in the same cell of the grid and then check the distance only with these neighbors (this will have O(N) algorithmic complexity). Is there any simpler way to find neighbors in Dealii, in MPI parallel framework?
-- The deal.II project is located at http://www.dealii.org/ For mailing list/forum options, see https://groups.google.com/d/forum/dealii?hl=en --- You received this message because you are subscribed to the Google Groups "deal.II User Group" group. To unsubscribe from this group and stop receiving emails from it, send an email to dealii+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
