|
From: | Yves Renard |
Subject: | Re: [Getfem-users] Delaunay triangulation of level set cut mesh |
Date: | Mon, 28 Nov 2016 10:00:06 +0100 |
User-agent: | Mozilla/5.0 (X11; Linux x86_64; rv:45.0) Gecko/20100101 Thunderbird/45.3.0 |
Dear Wen,
Yes, the mesh_level_set object performs most of the job : on each element cut by the crack, a certain number of intersection points are computed (the density of computed point depends on the curvature of the level set). Then Qhull is called to obtain a sub-mesh of the element conformal to the crack (or any set of level-sets). Some verifications are performed : if the obtained mesh is not conformal to the crack, more intersection points are computed. Additionally, the sub_mesh is stored by the object mesh_level_set and can be extracted (cut_mesh() method). If there is a lot of cut elements, it can be a bit expensive in term of memory (but not so much in practice) but it is necessary for post-treatment : it allows to interpolate the solution on a cut-mesh before drawing it. Yves. Le 23/11/2016 à 16:44, Wen Jiang a écrit :
-- Yves Renard (address@hidden) tel : (33) 04.72.43.87.08 Pole de Mathematiques, INSA-Lyon fax : (33) 04.72.43.85.29 20, rue Albert Einstein 69621 Villeurbanne Cedex, FRANCE http://math.univ-lyon1.fr/~renard --------- |
[Prev in Thread] | Current Thread | [Next in Thread] |