Subject: CGAL users discussion list
List archive
- From:
- To:
- Subject: Re: [cgal-discuss] Constrained Delaunay Tetrahedralization
- Date: Sun, 18 May 2008 16:50:49 +0200
Hi Henrique,
As the manual says, the 3D triangulation data structure stores a triangulation of the topological sphere S^{d} in R^{d+1}.
For more details, see the introduction of the user manual (chapter 28 or 27).
You can still play with functions like create_cell but as mentioned in the reference manual, then you may violate some properties tested by is_valid.
Still, seen from your few words, what you are trying to do could probably work. You must make sure that you restore all incidence and adjacency relations in a proper way.
You may want to look at the source code of insert_in_hole() of Triangulation_data_structure_3 to see an example of code doing something similar. Or maybe the remove() function of Delaunay_triangulation_3.
Hope this helps.
Best regards,
Monique Teillaud
Henrique Campos Fernandes wrote:
Hi colleagues,
I'm working in a facet recovery procedure in order to implement a constrained triangulation in 3D. To achieve this, I delete some tetrahedrons that intercept the missed facet, then I obtain a concavity. After this, I retriangulize this concavity separately (in another triangulation). The problem is how to join the two triangulations. I'm trying to use t.create_cell(Cell_handle) to add the new tetrahedrons, one by one, in the first triangulation but it becomes invalid.
Could you help me?
Thank you.
--
Henrique Campos Fernandes
Federal University of Minas Gerais - Brazil
- Constrained Delaunay Tetrahedralization, Henrique Campos Fernandes, 05/17/2008
- Re: [cgal-discuss] Constrained Delaunay Tetrahedralization, Monique . Teillaud, 05/18/2008
Archive powered by MHonArc 2.6.16.