Vachan, On Friday, February 11, 2022 at 12:51:49 AM UTC-5 vachanpo...@gmail.com wrote:
> Dear Dr. Wolfgang, > > Thank you very much for the kind reply. > > >> This is a very difficult operation to do even in sequential computations >> unless you have an analytical description of the boundary. That's because >> in >> principle you would have to compare the current position with all points >> (or >> at least all vertices) on the boundary -- which is very expensive to do >> if you >> had to do it for more than just a few points. The situation does not get >> better if you are in parallel, because then you don't even know all of the >> boundary vertices. > > Completely realise and agree. > Actually what Wolfgang is suggesting is very doable. We have wrappers for the ArborX library https://dealii.org/current/doxygen/deal.II/classArborXWrappers_1_1BVH.html which allows you to find the nearest neighbor between two point clouds very efficiently. You should be able to find the closest vertex on the boundary for 100,000 points in a couple of seconds on the CPU and for several millions of points if you are using a GPU. Right now we only have wrappers for the serial version of ArborX but I have actually started to work on the wrappers for distributed tree. When it's done, you will be able to get the nearest neighbor even if they are on different processors. Best, Bruno -- 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. To view this discussion on the web visit https://groups.google.com/d/msgid/dealii/87266398-5876-45f9-b51c-e9826df33f37n%40googlegroups.com.
