[...] I would like to process it in dealii by rotating it around y-axis, to get 3D grid.
Is it possible in dealii?
[...]
My objective is the mesh in the file the attached file perf_chamber.png, which was obtained by merging
the inner cylinder and outer cylinder shell. The mesh seems however to have some "double" vertices at
the interface between the merged entities, which possibly cause, that the computation fails, see image
velocity.png
1.,
const double
half_length = 1.
)
--
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 dealii+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
--
[...]
Is there some procedure in dealii to cope with this problem?the creation of the doubled vertices at the boundary between merged geoetries, meshes?meshes in gmsh and then merge them "safely" in the dealii? Safely meaning- withoutI want to ask a question, which could be interesting for other users of dealii-do we have some bulletproof procedure, how to produce (not so simple) geometries,The function merge_triangulation requieres "matching" triangulation, could it be possibleto define a function, which would somehow merge vertices at the boundary of two not-so-nicematching trianguations (possibly within some toleration, i.e. if two vertices are less then \epsaway from each other, than merge them....)Does my idea make sense?
This function is called by someGridIn::read_*functions.
Only the vertices with indices inconsidered_verticesare tested for equality. This speeds up the algorithm, which is quadratic and thus quite slow to begin with. However, if you wish to consider all vertices, simply pass an empty vector.
--
Only the vertices with indices inconsidered_verticesare tested for equality. This speeds up the algorithm, which is quadratic and thus quite slow to begin with. However, if you wish to consider all vertices, simply pass an empty vector.i.e. I have assumed it is called by default for all vertices.