CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

The dimension is not specified in your question, however the principal 
is similar.

You can find all simplices in conflict using either get_conflits [1] in
2D or find_conflits in 3D [2]. That way you can remove the Face_handle
from the map.

After insertion, you simply need to consider all faces incident to the
point you just inserted.

Sebastien.

[1] 
http://doc.cgal.org/latest/Triangulation_2/classCGAL_1_1Delaunay__triangulation__2.html#abfc0e6082e03efa41154e2b6379a66f8
[2] 
http://doc.cgal.org/latest/Triangulation_3/classCGAL_1_1Delaunay__triangulation__3.html#a6f0000d1a9fca5dd96a3835e86177e1d

On 09/09/2014 05:26 PM, Maria wrote:
> Hello,
>
> I am trying to solve a time dependent PDE on a delaunay triangulation. For
> that, I need to store values given on each /face/, e.g. with a
> map<Face_handle, double>.
> Now I want to insert a point in that delaunay triangulation which results in
> a new bundle of faces that do not have a value in the map. New faces should
> get a value such that the weighted sum of all values is preserved, old faces
> should be deleted from the map. My questions are:
>
> 1. How do I find all the faces, that were created due to the insertion? How
> do I know which face handles are not valid any more?
>
> 2. Is there a structure (something like a directed acyclic graph) that shows
> the relation between the removed face(s) and the new ones? Could I extract
> this information somehow out of the triangulation_hierarchy?
>
> Thanks in advance!
>
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Face-handles-after-inserting-a-point-into-a-delaunay-triangulation-tp4659811.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.