Function that determines if a given set of polygons represents a valid partition for a given sequence of points that define a simple, counterclockwise-oriented polygon. A valid partition is one in which the polygons are nonoverlapping and the union of the polygons is the same as the original polygon.
returns true iff the polygons in the range [poly_first,
poly_beyond) define a valid partition of the polygon defined by the
points in the range [point_first, point_beyond) and
Each polygon must also satisfy the property
tested by Traits::Is_valid().
The default traits class Default_traits is Partition_traits_2, with the representation type determined by InputIterator::value_type.
This function requires loglog where is the total number of vertices of the partition polygons, is the total number of edges of the partition polygons and is the time required by Traits::Is_valid() to test if partition polygon is valid.
See the example presented with the function optimal_convex_partition_2 for an illustration of the use of this function.