CGAL 6.2 - 2D Polygon Partitioning: Class and Concept List

CGAL 6.2 - 2D Polygon Partitioning

Loading...
Searching...
No Matches
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 12]

▼NCGAL |
C Is_convex_2 | Function object class for testing if a sequence of points represents a convex polygon or not
C Is_vacuously_valid | Function object class that indicates all sequences of points are valid
C Is_y_monotone_2 | Function object class that tests whether a sequence of points represents a \( y\)-monotone polygon or not
C Partition_is_valid_traits_2 | Class that derives a traits class for `partition_is_valid_2()` from a given traits class by defining the validity testing function object in terms of a supplied template parameter
C Partition_traits_2 | Traits class that can be used with all the 2-dimensional polygon partitioning algorithms
C ConvexPartitionIsValidTraits_2 | Requirements of a traits class used by `convex_partition_is_valid_2` for testing the validity of a convex partition of a polygon
C IsYMonotoneTraits_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
C OptimalConvexPartitionTraits_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
C PartitionIsValidTraits_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
C PartitionTraits_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
C PolygonIsValid | Function object that determines if a sequence of points represents a valid partition polygon or not, where "valid" can assume any of several meanings (e.g., convex or \( y\)-monotone)
C YMonotonePartitionIsValidTraits_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