CGAL 5.0.2 - 2D Polygon Partitioning

## Concepts

conceptConvexPartitionIsValidTraits_2
Requirements of a traits class used by convex_partition_is_valid_2 for testing the validity of a convex partition of a polygon. More...

conceptIsYMonotoneTraits_2
Requirements of a traits class to be used with the function is_y_monotone_2() that tests whether a sequence of 2D points defines a $$y$$-monotone polygon or not. More...

conceptOptimalConvexPartitionTraits_2
Requirements of a traits class to be used with the function optimal_convex_partition_2() that computes an optimal convex partition of a polygon. More...

conceptPartitionIsValidTraits_2
Requirements of a traits class that is used by CGAL::partition_is_valid_2(), CGAL::convex_partition_is_valid_2(), and CGAL::y_monotone_partition_is_valid_2() for testing if a given set of polygons are nonoverlapping and if their union is a polygon that is the same as a polygon represented by a given sequence of points. Note that the traits class for CGAL::partition_is_valid_2() may have to satisfy additional requirements if each partition polygon is to be tested for having a particular property; see, for example, the descriptions of the function CGAL::is_convex_2() and the concept YMonotonePartitionTraits_2 for the additional requirements for testing for convexity and $$y$$-monotonicity, respectively. More...

conceptPartitionTraits_2
The polygon partitioning functions are each parameterized by a traits class that defines the primitives used in the algorithms. Many requirements are common to all traits classes. The concept PartitionTraits_2 defines this common set of requirements. More...

conceptYMonotonePartitionIsValidTraits_2
Requirements of a traits class that is used by y_monotone_partition_is_valid_2 for testing the validity of a $$y$$-monotone partition of a polygon. More...