CGAL users discussion list

[Victor Lopez <>]

I´m talking about this fuction.

http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Arrangement_on_surface_2/Chapter_main.html#Subsection_32.10.2

By calling remove(arr,ch), where ch is a valid curve handle, the given curve is deleted from the curve container, and all edges induced solely by this curve (i.e., excluding overlapping edges) are removed from the arrangement. The function returns the number of edges that have been removed.

Hugo, 

I'm very interested in what your are doing since I'm doing something similar.

 I'm doing an heuristic search and using certain features of the arrangement to check if he solution improves or not, if it does not improve I have to undo the last movement. (Delete the last curve inserted)

I'm using  remove(arr,ch) to undo that movement I was wondering if your approach has any advantages over this.

2013/3/11 Tapadi <>

Okay, I finally did implement it. As remove_edge( ... ) has optional
parameters for removing automatically redundant halfedges' sources and
targets, it is rather basic actually. I don't even need merge_edge(...)
anymore.

Thank you again!

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-tp4656886p4656899.html

Sent from the cgal-discuss mailing list archive at Nabble.com.

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss