| 
    CGAL 4.7 - 2D Polygon Partitioning 
   | 
 
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).
CGAL::Is_convex_2<Traits> 
CGAL::Is_y_monotone_2<Traits> 
Creation | |
| PolygonIsValid (const Traits tr) | |
Traits is a model of the concept required by the function that checks for validity of the polygon.  More... | |
Operations | |
| template<class InputIterator > | |
| bool | operator() (InputIterator first, InputIterator beyond) | 
returns true iff the points of type Traits::Point_2 in the range [first,beyond) define a valid polygon.  More... | |
| PolygonIsValid::PolygonIsValid | ( | const Traits | tr | ) | 
Traits is a model of the concept required by the function that checks for validity of the polygon. 
| bool PolygonIsValid::operator() | ( | InputIterator | first, | 
| InputIterator | beyond | ||
| ) | 
returns true iff the points of type Traits::Point_2 in the range [first,beyond) define a valid polygon.