CGAL 6.1 - 2D Polygon Partitioning
|
#include <CGAL/polygon_function_objects.h>
Function object class for testing if a sequence of points represents a convex polygon or not.
PolygonIsValid
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. | |
CGAL::Is_convex_2< Traits >::Is_convex_2 | ( | const Traits & | t | ) |
Traits
satisfies the requirements of the function is_convex_2()
bool CGAL::Is_convex_2< Traits >::operator() | ( | InputIterator | first, |
InputIterator | beyond | ||
) |
returns true
iff the points of type Traits::Point_2
in the range [first
,beyond
) define a convex polygon.