CGAL users discussion list

[Tapadi <>]

Hi all,

2013/3/10 Efi Fogel
> 
> This sounds good. If you need to go back to an exact previous state, you
> may want to consider extending each vertex and
> halfedge with time stamp.

... Or with a growing id that characterizes the number of modifications
before they appeared. That looks very good to me, it will provide a huge
acceleration when I want to "undo" insertions of big curve packs.
 
2013/3/10 Victor Lopez
> Why not use remove(arr,ch) instead of  remove_edge() and merge_edge() ?

Hmm, puzzling. I searched for a while for a function looking like
CGAL::remove(Arrangement_with_history_2 arr, Curve_handle ch) but did not
find it... The only reference I found is typename
Arrangement_with_history_2<Traits,Dcel>::Size remove_curve (...) at this
url:

http://read.pudn.com/downloads109/sourcecode/math/449693/CGAL-3.3.1/include/CGAL/Arrangement_with_history_2.h__.htm

I'm looking in the book too, but still not found yet. Anyway, does the
function you refer to removes the vertices created by the curve's insertion,
in addition to the induced edges?

Thanks to you both for your answers.
Best regards,
Hugo Loi
PhD student at Inria - Maverick Team
http://maverick.inria.fr/



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Arrangement-2-Undo-tp4656886p4656891.html
Sent from the cgal-discuss mailing list archive at Nabble.com.