On Friday, 22 September 2017 17:50:13 CEST Jeremy Theler wrote: > At first I did not understand your point, but after a second look it > seems to me you are referring to the faces of the volumetric elements > that are in the bulk of a volume (i.e. the triangles that conform a > tetrahedron) so you can detect neighboring cells, aren't you? If > that is the case, then it is an old unresolved issue:
Thank you for your response. So, just to be sure we are on the same page. Consider a 2D grid, it has vertices (points), faces (lines joining points) and cells (polygons). Gmsh outputs the vertices, the cells and the boundary faces only. My objective is now to generate the interior faces as well, and this is the process which is slow for me. Is this the same process you are referring to when you say it is an unresolved issue? If yes, then thank you. You solved my question, since I see you mentioning that you use a poorly designed algorithm to do this and I think this is the best one can do straight from gmsh. -- Cheers Jayesh Badwaik https://www.jayeshbadwaik.in
signature.asc
Description: This is a digitally signed message part.
_______________________________________________ gmsh mailing list [email protected] http://onelab.info/mailman/listinfo/gmsh
