CGAL 5.6.3 - 2D Polygon Partitioning

Loading...
Searching...
No Matches
List of all members
CGAL::Is_convex_2< Traits > Class Template Reference
2D Polygon Partitioning Reference » Function Object Classes

`#include <CGAL/polygon_function_objects.h>`

## Definition

template<typename Traits>
class CGAL::Is_convex_2< Traits >

Function object class for testing if a sequence of points represents a convex polygon or not.

Is Model Of:
  `PolygonIsValid`

See also
  `CGAL::convex_partition_is_valid_2()`
  `CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>`

Implementation

This test requires \( O(n)\) time for a polygon with \( n\) vertices.

## Creation
| Is_convex_2 (const Traits &t)
| `Traits` satisfies the requirements of the function `is_convex_2()`

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