On Tue, 12 Apr 2011, Boyce Griffith wrote:
> On 4/12/11 1:21 PM, Roy Stogner wrote:
>>
>> On Tue, 12 Apr 2011, Boyce Griffith wrote:
>>
>>> How are elements ordered in the element iterators in adaptively
>>> refined meshes? Do you loop over level 0, then level 1, then level 2?
>>> Or does the ordering of the elements get changed with AMR?
>>
>> The ordering of existing elements doesn't get changed, but the
>> ordering is very path-dependent; new elements generally get tacked on
>> to the end of the list, and renumbered downward when coarsening frees
>> up lower element numbers.
>
> OK; then can one do something like:
>
> coarse_elem_it = coarse_mesh->elements_begin();
> coarse_elem_end = coarse_mesh->elements_end();
> fine_elem_it = fine_mesh->elements_begin();
> for (; coarse_elem_it != coarse_elem_end;
> ++coarse_elem_it, ++fine_elem_it)
> {
> Elem* coarse_elem = *coarse_elem_it;
> Elem* fine_elem = *fine_elem_it;
> // map coarse grid DOF indices to fine grid DOF indices
> }
I believe this will work, if you're only using SerialMesh, if you're
only using LAGRANGE elements, for the moment. It may break in the
future, it will fail on non-LAGRANGE elements, it will fail on
ParallelMesh, and I might just be plain incorrect. ;-)
---
Roy
------------------------------------------------------------------------------
Forrester Wave Report - Recovery time is now measured in hours and minutes
not days. Key insights are discussed in the 2010 Forrester Wave Report as
part of an in-depth evaluation of disaster recovery service providers.
Forrester found the best-in-class provider in terms of services and vision.
Read this report now! http://p.sf.net/sfu/ibm-webcastpromo
_______________________________________________
Libmesh-users mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/libmesh-users
