Dear all,
I have been designing 2D grids according to the standards given in:
https://www.dealii.org/8.4.1/doxygen/deal.II/structGeometryInfo.html
The procedure goes as follows,
1) we introduce a set of vertices as points (x_i,y_i), numbered by the
index "i",
2) connect them forming quads/cells and store the numbering as: cell_nodes
[k] = {i1,i2,i3,i4},
3) making sure that i1,i2,i3,i4 follow a lexicographic ordering explained
in .../structGeometryInfo.html.
In 2D it is messy already to satisfy 1), 2), 3) for non-trivial/primitive
meshes, but we always can sketch the situation, because it is 2D, and by
rotating cells (ordering) we hope that eventually a solution will come out.
Now, the sketch part is not available in 3D and the number of
permutations/rotations has increased dramatically. This leads me to the
following question:
Is there a tool within deal.II to impose 3), when 1) and 2) are given?
In other words, is there any tool available, such that we get an array
new_cell_nodes satisfying a lexicographic ordering, by inputting the
arrays: vertex, cell_nodes?
Ideas on how to achieve this are greatly appreciated!
Thanks in advance,
Juan Carlos Araújo, Umeå Universitet
--
The deal.II project is located at http://www.dealii.org/
For mailing list/forum options, see
https://groups.google.com/d/forum/dealii?hl=en
---
You received this message because you are subscribed to the Google Groups
"deal.II User Group" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/d/optout.
