<html dir="ltr">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<style id="owaParaStyle" type="text/css">
<!--
p
{margin-top:0;
margin-bottom:0}
p
{margin-top:0;
margin-bottom:0}
-->
P {margin-top:0;margin-bottom:0;}</style>
</head>
<body ocsi="0" fpstyle="1">
<div style="direction: ltr;font-family: Tahoma;color: #000000;font-size: 10pt;">Hi Andreas,<br>
<div><br>
<div style="font-family:Tahoma; font-size:13px">I'm currently implementing an algorithm that requires to know, for each element of the grid, its neighbours. Simply it'd be easier if I had a method that, given the current element, returns the list of neighbours;
nevermind, I'll write down a routine that does so.<br>
<br>
Cheers,<br>
Andrea <br>
__________________________________________________________<br>
<br>
Andrea Sacconi<br>
PhD student, Applied Mathematics<br>
AMMP Section, Department of Mathematics, Imperial College London,<br>
London SW7 2AZ, UK<br>
a.sacconi11@imperial.ac.uk<br>
</div>
</div>
<div style="font-family: Times New Roman; color: #000000; font-size: 16px">
<hr tabindex="-1">
<div style="direction: ltr;" id="divRpF860763"><font color="#000000" face="Tahoma" size="2"><b>From:</b> Dedner, Andreas [A.S.Dedner@warwick.ac.uk]<br>
<b>Sent:</b> 18 October 2012 11:12<br>
<b>To:</b> Sacconi, Andrea; dune@dune-project.org<br>
<b>Subject:</b> RE: [Dune] Getting the list of neighbours for a given element of the grid<br>
</font><br>
</div>
<div></div>
<div>
<div style="direction:ltr; font-family:Tahoma; color:#000000; font-size:10pt">The interesection iterator is the only way to access neighbors in DUNE. Why would you want to<br>
have something else?<br>
<br>
Best<br>
Andreas<br>
<br>
<div style="font-family:Times New Roman; color:#000000; font-size:16px">
<hr tabindex="-1">
<div id="divRpF306064" style="direction:ltr"><font color="#000000" face="Tahoma" size="2"><b>From:</b> dune-bounces+a.s.dedner=warwick.ac.uk@dune-project.org [dune-bounces+a.s.dedner=warwick.ac.uk@dune-project.org] on behalf of Sacconi, Andrea [a.sacconi11@imperial.ac.uk]<br>
<b>Sent:</b> 18 October 2012 11:05<br>
<b>To:</b> dune@dune-project.org<br>
<b>Subject:</b> [Dune] Getting the list of neighbours for a given element of the grid<br>
</font><br>
</div>
<div></div>
<div>
<div style="direction:ltr; font-family:Tahoma; color:#000000; font-size:10pt">Hi everyone,<br>
<br>
I've a question about the grid.<br>
Suppose you're interested in finding all the neighbours for a given element of a conforming grid. Is there a method that, given an element, tells you directly which are its neighbours?<br>
Or is it necessary to traverse the Intersections and get that information with a loop?<br>
<br>
Thanks in advance!<br>
<div><br>
<div style="font-family:Tahoma; font-size:13px">Andrea<br>
__________________________________________________________<br>
<br>
Andrea Sacconi<br>
PhD student, Applied Mathematics<br>
AMMP Section, Department of Mathematics, Imperial College London,<br>
London SW7 2AZ, UK<br>
a.sacconi11@imperial.ac.uk<br>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</body>
</html>