CGAL users discussion list

[Maria <>]

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.