On Monday, April 16, 2018 at 11:53:20 AM UTC-4, Bryukhanov Ilya wrote:
> I heard about algorithms that produce mean asymptotic O(log(N)) or at
> least O(square root (N))
To do that you need to first build a tree and then search in it. This is
not what is done the current function but if you need it, it shouldn't be
too hard to do. You just need to compute the bounding boxes of each cells
(which is trivial if your mesh is cartesian) and then use nanoflann or
boost to do the search. There is already a wrapper for nanoflann
http://dealii.org/developer/doxygen/deal.II/classKDTree.html and the
concept of bounding boxes already exists
The deal.II project is located at http://www.dealii.org/
For mailing list/forum options, see
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
For more options, visit https://groups.google.com/d/optout.