[Dune] List of surrounding points for any given vertex in 2D triangular meshes

Sacconi, Andrea a.sacconi11 at imperial.ac.uk
Fri Jan 17 17:22:51 CET 2014


Hi DUNErs,

I would like to ask you a quick question.
Suppose that you are working with 2D, triangular meshes; to be more precise, conforming meshes. For any given vertex, there is a certain number of surrounding vertices around, topologically connected with it. In other words, all the vertices which are second extreme of a segment, whose first extreme is the given point.
What is the quickest way, within DUNE framework, to extract the global index of those vertices, given the index of the one in the middle?

I was thinking of iterating over the elements, playing around with intersections and subIndices but it seems inefficient.
Any clever suggestions?

Thank you very much!
Andrea
__________________________________________________________

Andrea Sacconi
PhD student, Applied Mathematics
AMMP Section, Department of Mathematics, Imperial College London,
London SW7 2AZ, UK
a.sacconi11 at imperial.ac.uk




More information about the Dune mailing list