## "Fossies" - the Fresh Open Source Software Archive

### Member "doc_html/Partition_2/classCGAL_1_1Is__convex__2.html" (8 Nov 2019, 11346 Bytes) of package /linux/misc/CGAL-4.14.2-doc_html.tar.xz:

Caution: In this restricted "Fossies" environment the current HTML page may not be correctly presentated and may have some non-functional links. You can here alternatively try to browse the pure source code or just view or download the uninterpreted raw source code. If the rendering is insufficient you may try to find and view the page on the CGAL-4.14.2-doc_html.tar.xz project site itself.

 CGAL 4.14.2 - 2D Polygon Partitioning
CGAL::Is_convex_2< Traits > Class Template Reference

#include <CGAL/polygon_function_objects.h>

## Definition

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

Is Model Of:
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.

Examples:
Partition_2/optimal_convex_partition_2.cpp.

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