Thanks. <br><br>In fact, i came across this paper just 10min after writing to the list, and i wasn't even looking for anything. I'm terribly sorry, but i just missed it in the middle of everything else.<br><br>Thank you so much for the fast answer again David,<br>
best regards,<br>Ricardo Canelas<br><br><br><br><br><br><div class="gmail_quote">2009/11/21 David Colignon <span dir="ltr"><<a href="mailto:David.Colignon@ulg.ac.be" target="_blank">David.Colignon@ulg.ac.be</a>></span><br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">Hi Ricardo,<br>
<br>
may I suggest you to read<br>
<br>
``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''<br>
<br>
<a href="http://geuz.org/gmsh/gmsh_paper_preprint.pdf" target="_blank">http://geuz.org/gmsh/gmsh_paper_preprint.pdf</a><br>
<br>
Regards,<br>
<br>
Dave<br>
<br>
--<br>
David Colignon, Ph.D.<br>
Collaborateur Logistique du F.R.S.-FNRS<br>
CÉCI - Consortium des Équipements de Calcul Intensif<br>
ACE - Applied & Computational Electromagnetics<br>
Institut Montefiore B28<br>
Université de Liège<br>
4000 Liège - BELGIQUE<br>
Tél: +32 (0)4 366 37 32<br>
Fax: +32 (0)4 366 29 10<br>
WWW: <a href="http://hpc.montefiore.ulg.ac.be/" target="_blank">http://hpc.montefiore.ulg.ac.be/</a><br>
Agenda: <a href="http://www.google.com/calendar/embed?src=david.colignon%40gmail.com" target="_blank">http://www.google.com/calendar/embed?src=david.colignon%40gmail.com</a><div><div></div><div><br>
<br>
On 20/11/09 18:14, Ricardo Canelas wrote:<br>
</div></div><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;"><div><div></div><div>
Hi!<br>
<br>
I'm relatively new to this world so go soft on me.<br>
<br>
I am using Gmsh as a mesh generator for a 2D CFD code on my master<br>
thesis, but the thing is that i have to be able to explain every step<br>
taken by Gmsh when it computes an unstructured mesh. I can't understand<br>
the inicial step described in the manual :<br>
<br>
"For all 2D unstructured algorithms a Delaunay mesh that contains all<br>
the points of the<br>
1D mesh is initially constructed using a divide-and-conquer algorithm.<br>
Missing edges are<br>
recovered using edge swaps. After this initial step three different<br>
algorithms can be applied<br>
to generate the final mesh..."<br>
<br>
What 1D mesh? How are there missing edges?<br>
<br>
The second questions comes regarding the point generation algorithm. I<br>
can't find any reference to any, like grid superposition, boudary point<br>
distribution...<br>
<br>
Any help is more than welcome!<br>
<br>
Best regards,<br>
<br>
<br>
--<br>
Ricardo Canelas<br>
CEHIDRO - Instituto Superior Técnico, UT Lisboa<br>
<br>
<br>
<br></div></div>
_______________________________________________<br>
gmsh mailing list<br>
<a href="mailto:gmsh@geuz.org" target="_blank">gmsh@geuz.org</a><br>
<a href="http://www.geuz.org/mailman/listinfo/gmsh" target="_blank">http://www.geuz.org/mailman/listinfo/gmsh</a><br>
</blockquote>
<br>
</blockquote></div><br><br clear="all"><br>-- <br>Ricardo Canelas<br><br><a href="http://www.nucleoartefotografica.com" target="_blank">http://www.nucleoartefotografica.com</a><br><a href="http://www.flickr.com/photos/canelus/" target="_blank">http://www.flickr.com/photos/canelus/</a><br>
<a href="http://www.myspace.com/rcanelas" target="_blank">http://www.myspace.com/rcanelas</a><br><a href="http://couvesparatodos.blogspot.com" target="_blank">http://couvesparatodos.blogspot.com</a> <br>