CGAL::insert_curves

#include <CGAL/Arrangement_2.h>

template<class Traits, class Dcel, InputIterator>
void	insert_curves ( Arrangement_2<Traits,Dcel>& arr, InputIterator first, InputIterator last)
		Aggregately inserts the given range of curves [first,last) into the arrangement arr, where no restrictions are made on the nature of the inserted curves. The Traits parameter must be a model of the ArrangementTraits_2 concept. The input curves are subdivided into $$x-monotone subcurves (and perhaps isolated points), which are inserted into the arrangement using the sweep-line algorithm. Precondition: The value-type of InputIterator is Traits::Curve_2.

#include <CGAL/Arrangement_with_history_2.h>

template<class Traits, class Dcel, InputIterator>
void	insert_curves ( Arrangement_with_history_2<Traits,Dcel>& arr, InputIterator first, InputIterator last)
		Aggregately inserts the given range of curves [first,last) into the arrangement arr. Precondition: The value-type of InputIterator is Traits::Curve_2.