advanced |
#include <CGAL/partition_is_valid_2.h>
| ||||
|
| |||
determines if the polygons in the range [poly_first, poly_beyond)
define a valid convex partition of the polygon defined by the points in the
range [point_first, point_beyond).
The function returns true iff the partition is valid and otherwise
returns false. Precondition: The points in the range [point_first, point_beyond) define a simple, counterclockwise-oriented polygon. |
The default traits class Default_traits is Partition_traits_2, with the representation type determined by InputIterator::value_type.
CGAL::approx_convex_partition_2
CGAL::greene_approx_convex_partition_2
CGAL::optimal_convex_partition_2
CGAL::partition_is_valid_2
CGAL::is_convex_2
This function calls partition_is_valid_2 using the function object Is_convex_2 to determine the convexity of each partition polygon. Thus the time required by this function is loglog where is the total number of vertices in the partition polgons and the total number of edges.
See the example presented with the function approx_convex_partition_2 for an illustration of the use of this function.
advanced |