[Dune] Getting the list of neighbours for a given element of the grid

[Sacconi, Andrea]

Hi Christian,

yes, I will use this list to continue performing the algorithm.
The advantage of having such a method already implemented somewhere would be to skip the loop over Intersections to get an Entity pointer to the neighbours.
Anyway, I don't think it'll require so many lines of code.

Cheers,
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

________________________________________
From: christi at mathe-macht-spass.de [christi at mathe-macht-spass.de] on behalf of Christian Engwer [christian.engwer at uni-muenster.de]
Sent: 18 October 2012 11:27
To: Sacconi, Andrea
Cc: Dedner, Andreas; dune at dune-project.org
Subject: Re: [Dune] Getting the list of neighbours for a given element of the grid

On Thu, Oct 18, 2012 at 10:17:29AM +0000, Sacconi, Andrea wrote:
> Hi Andreas,
>
> 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.

But in the end you will use this list ot iterate over, won't you?!

An iterator range is basically the abstraction of an object list.

Christian

> Cheers,
> 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
> ________________________________
> From: Dedner, Andreas [A.S.Dedner at warwick.ac.uk]
> Sent: 18 October 2012 11:12
> To: Sacconi, Andrea; dune at dune-project.org
> Subject: RE: [Dune] Getting the list of neighbours for a given element of the grid
>
> The interesection iterator is the only way to access neighbors in DUNE. Why would you want to
> have something else?
>
> Best
> Andreas
>
> ________________________________
> From: dune-bounces+a.s.dedner=warwick.ac.uk at dune-project.org [dune-bounces+a.s.dedner=warwick.ac.uk at dune-project.org] on behalf of Sacconi, Andrea [a.sacconi11 at imperial.ac.uk]
> Sent: 18 October 2012 11:05
> To: dune at dune-project.org
> Subject: [Dune] Getting the list of neighbours for a given element of the grid
>
> Hi everyone,
>
> I've a question about the grid.
> 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?
> Or is it necessary to traverse the Intersections and get that information with a loop?
>
> Thanks in advance!
>
> 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

> _______________________________________________
> Dune mailing list
> Dune at dune-project.org
> http://lists.dune-project.org/mailman/listinfo/dune


--
Prof. Dr. Christian Engwer
Institut für Numerische und Angewandte Mathematik
Fachbereich Mathematik und Informatik der Universität Münster
Einsteinstrasse 62
48149 Münster

E-Mail  christian.engwer at uni-muenster.de
Telefon +49 251 83-35067
FAX             +49 251 83-32729