On Thu, 16 Oct 2008, Derek Gaston wrote: > Has anyone answered you yet?
Whoops! I thought about mentioning MeshFunction, but hesitated to do so because it just felt like there ought to be a better answer out there. MeshFunction works via "Do a local inverse map to see if this point is in the last element we checked, and do an octree search if it's not", none of which should be necessary when you're always projecting from one variable to another (even in another system) on the same element. But I guess as long as this projection isn't happening too often efficiency doesn't matter, and while p-coarsening uniform meshes of hierarchic elements efficiently is easy, handling hanging nodes or Lagrange elements gets a bit trickier. --- Roy ------------------------------------------------------------------------- This SF.Net email is sponsored by the Moblin Your Move Developer's challenge Build the coolest Linux based applications with Moblin SDK & win great prizes Grand prize is a trip for two to an Open Source event anywhere in the world http://moblin-contest.org/redirect.php?banner_id=100&url=/ _______________________________________________ Libmesh-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/libmesh-users
