\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.8 - 2D Polygon Partitioning

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
PolygonIsValid Concept Reference
Function Object Concepts

## Definition

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).

Has Models:

  `CGAL::Is_convex_2<Traits>`

  `CGAL::Is_y_monotone_2<Traits>`

See Also
  `CGAL::approx_convex_partition_2()`
  `CGAL::convex_partition_is_valid_2()`
  `CGAL::greene_approx_convex_partition_2()`
  `CGAL::optimal_convex_partition_2()`
  `CGAL::partition_is_valid_2()`
  `CGAL::y_monotone_partition_2()`
  `CGAL::y_monotone_partition_is_valid_2()`

## Creation
| PolygonIsValid (const Traits tr)
| `Traits` is a model of the concept required by the function that checks for validity of the polygon.

## 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.