CGAL users discussion list

[chrism <>]

Hi all, my past two questions ended up being me missing documentation, so I
apologize in advance if this is the case here. However, I don't think it is.

Suppose I have a triangulation T1, and I create a copy of it in T2 (so T1
and T2 are equal in every way). Then, I want to iterate over the faces of T1
and T2 simultaneously with iterators t1 and t2. However, I want the
constraint that t1 and t2 point to the 'same' face in T1 and T2.

This would be analogous to traversing two duplicated vectors, where v[0] ==
v2[0].

From what I understand, finite_face_iterator makes no guarantees about the
determinism of: a) the starting face or b) traversal order. 

I can envision a hacky way of storing pointers in one triangulation's face
to the matching face in the other triangulation (e.g., looking for the
triangle in T2 the centre point of T1 lies in), but this is pretty gross.

Is there  a way of 'properly' or at least elegantly doing this? 


Thanks.



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Simultaneous-iteration-over-duplicate-triangulations-tp4659640.html
Sent from the cgal-discuss mailing list archive at Nabble.com.