Hi Ricardo, may I suggest you to read
``C. Geuzaine and J.-F. Remacle. Gmsh: a three-dimensional finite element mesh generator with built-in pre- and post-processing facilities. International Journal for Numerical Methods in Engineering, Volume 79, Issue 11, pages 1309-1331, 2009''
http://geuz.org/gmsh/gmsh_paper_preprint.pdf Regards, Dave -- David Colignon, Ph.D. Collaborateur Logistique du F.R.S.-FNRS CÉCI - Consortium des Équipements de Calcul Intensif ACE - Applied & Computational Electromagnetics Institut Montefiore B28 Université de Liège 4000 Liège - BELGIQUE Tél: +32 (0)4 366 37 32 Fax: +32 (0)4 366 29 10 WWW: http://hpc.montefiore.ulg.ac.be/ Agenda: http://www.google.com/calendar/embed?src=david.colignon%40gmail.com On 20/11/09 18:14, Ricardo Canelas wrote:
Hi! I'm relatively new to this world so go soft on me. I am using Gmsh as a mesh generator for a 2D CFD code on my master thesis, but the thing is that i have to be able to explain every step taken by Gmsh when it computes an unstructured mesh. I can't understand the inicial step described in the manual : "For all 2D unstructured algorithms a Delaunay mesh that contains all the points of the 1D mesh is initially constructed using a divide-and-conquer algorithm. Missing edges are recovered using edge swaps. After this initial step three different algorithms can be applied to generate the final mesh..." What 1D mesh? How are there missing edges? The second questions comes regarding the point generation algorithm. I can't find any reference to any, like grid superposition, boudary point distribution... Any help is more than welcome! Best regards, -- Ricardo Canelas CEHIDRO - Instituto Superior Técnico, UT Lisboa _______________________________________________ gmsh mailing list [email protected] http://www.geuz.org/mailman/listinfo/gmsh
_______________________________________________ gmsh mailing list [email protected] http://www.geuz.org/mailman/listinfo/gmsh
