Dear all, Is there any easy way to loop over all elems that are neighbors of a given elem accross either a face or an edge? As fas as I understand, Elem::neighbor() only cares about neighbors accross faces. On the other hand, Elem::find_point_neighbors() does too much. I think, it should be easy to implement a method Elem::find_edge_neighbors() analogously to Elem::find_point_neighbors(), where just each call to Elem::contains_vertex_of() is replaced with a call to Elem::contains_edge_of(), the latter is implemented analogously to Elem::contains_vertex_of() with the only difference that for returning true, it requires at least *two* vertices of the one element contained to be contained in the other. What do you guys think? If you agree that this would be correct, I'd be happy to do this (easy and straightforward) task.
Best Regards, Tim -- Dr. Tim Kroeger [email protected] Phone +49-421-218-7710 [email protected] Fax +49-421-218-4236 Fraunhofer MEVIS, Institute for Medical Image Computing Universitaetsallee 29, 28359 Bremen, Germany ------------------------------------------------------------------------------ Come build with us! The BlackBerry(R) Developer Conference in SF, CA is the only developer event you need to attend this year. Jumpstart your developing skills, take BlackBerry mobile applications to market and stay ahead of the curve. Join us from November 9 - 12, 2009. Register now! http://p.sf.net/sfu/devconference _______________________________________________ Libmesh-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/libmesh-users
