On Thu, 10 Jun 2010, Karen Lee wrote: > There's PointLocatorTree and PointLocatorList to choose from > that has the function I need implemented. Do you have any advice which one > to stick to and some insight into how they differ? > http://libmesh.sourceforge.net/doxygen/point__locator__base_8C_source.php#l00047
IIRC, Tree is O(N log N) to build, but O(log N) in lookup time. List is cheap to build, but O(N) lookup time. Tree gets built by default if you use MeshBase::point_locator() to request it. You also might want to look at Elem::contains_point(); if you're looping through elements anyway to do some assembly then often you can most efficiently check for points in those elements at the same time. --- Roy ------------------------------------------------------------------------------ ThinkGeek and WIRED's GeekDad team up for the Ultimate GeekDad Father's Day Giveaway. ONE MASSIVE PRIZE to the lucky parental unit. See the prize list and enter to win: http://p.sf.net/sfu/thinkgeek-promo _______________________________________________ Libmesh-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/libmesh-users
