Hi Benjamin Kirk writes: > > Making the "bins" larger would just make the problem less likely to > > trigger. Using our old keys (based on pointer values) would fail on > > a ParallelMesh. Searching all neighboring bin keys would make > > LocationMap::find() take 3^d times longer, but that's the best fix I > > can think of. Anyone else have any suggestions before I get to it?
Why wouldn't two nodes at the same coordinates have the same float representation? The only alternative I see is to round to a certain number of digits (I guess that is what you call "increase bin size"). > Could the hilbert keys help? The comparison function should be more > helpful. I think what you would do is search for the key, and if it is not > found look up and down one entry -- that should give the closest nodes. Since I like moving mesh nodes around, I am not a big fan of Hilbert keys (yet). How can I request a recalculation of all keys? Could that lead to hard to find problems (like the one I experienced because partitioning uses Hilbert keys)? Thanks, Martin ------------------------------------------------------------------------- This SF.net email is sponsored by: Microsoft Defy all challenges. Microsoft(R) Visual Studio 2008. http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ _______________________________________________ Libmesh-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/libmesh-users
