CGAL users discussion list

[Zohar <>]

Yes, I could also hold a map from cell handle to boolean value, or other
creative stuff, but it's all sound too cumbersome, and adds a complexity for
algorithms that use it. I wouldn't be able for example to extract the
surface by simply iterating the faces of the infinite cell. Also when I add
points to the triangulation, some of the marked tets would decide to split
or something, and I would lose the marking. So the easiest solution I see so
far is:

1. Generate a triangulation T1 using c3t3.
2. Construct with the points of T1 a new delaunay triangulation 3, T2.
3. Add some new points to T2 (could be inside or outside of T1 shape).
4. Copy T2 to a standard triangulation 3, T3.
5. Remove cells from T3, whose center isn't in T1 and don't have one of the
points from 3 as an ear...
6. Work with T3, and if there's a need to change the triangulation repeat a
similar process ...

and better ideas would be welcomed.

--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Triangulation-3-and-C3t3-questions-tp4655454p4655468.html
Sent from the cgal-discuss mailing list archive at Nabble.com.