CGAL Namespace Reference

Classes
class	Is_convex_2
	Function object class for testing if a sequence of points represents a convex polygon or not. More...
class	Is_vacuously_valid
	Function object class that indicates all sequences of points are valid. More...
class	Is_y_monotone_2
	Function object class that tests whether a sequence of points represents a $y$-monotone polygon or not. More...
class	Partition_is_valid_traits_2
	Class that derives a traits class for partition_is_valid_2() from a given traits class by defining the validity testing function object in terms of a supplied template parameter. More...
class	Partition_traits_2
	Traits class that can be used with all the 2-dimensional polygon partitioning algorithms. More...

Functions
template<class InputIterator , class Traits >
bool	is_y_monotone_2 (InputIterator first, InputIterator beyond, const Traits &traits)
	determines if the sequence of points in the range [first, beyond) defines a $y$-monotone polygon or not.
template<class InputIterator , class OutputIterator , class Traits >
OutputIterator	approx_convex_partition_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &traits=Default_traits)
	computes a partition of the polygon defined by the points in the range [first, beyond) into convex polygons.
template<class InputIterator , class OutputIterator , class Traits >
OutputIterator	greene_approx_convex_partition_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &traits=Default_traits)
	computes a partition of the polygon defined by the points in the range [first, beyond) into convex polygons.
template<class InputIterator , class OutputIterator , class Traits >
OutputIterator	optimal_convex_partition_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &traits=Default_traits)
	computes a partition of the polygon defined by the points in the range [first, beyond) into convex polygons.
template<class InputIterator , class OutputIterator , class Traits >
OutputIterator	y_monotone_partition_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &traits=Default_traits)
	computes a partition of the polygon defined by the points in the range [first, beyond) into $y$-monotone polygons.
template<class InputIterator , class ForwardIterator , class Traits >
bool	convex_partition_is_valid_2 (InputIterator point_first, InputIterator point_beyond, ForwardIterator poly_first, ForwardIterator poly_beyond, const Traits &traits=Default_traits)
	determines if the polygons in the range [poly_first, poly_beyond) define a valid convex partition of the polygon defined by the points in the range [point_first, point_beyond).
template<class InputIterator , class ForwardIterator , class Traits >
bool	partition_is_valid_2 (InputIterator point_first, InputIterator point_beyond, ForwardIterator poly_first, ForwardIterator poly_beyond, const Traits &traits=Default_traits)
	returns true iff the polygons in the range [poly_first, poly_beyond) define a valid partition of the polygon defined by the points in the range [point_first, point_beyond) and false otherwise.
template<class InputIterator , class ForwardIterator , class Traits >
bool	y_monotone_partition_is_valid_2 (InputIterator point_first, InputIterator point_beyond, ForwardIterator poly_first, ForwardIterator poly_beyond, const Traits &traits=Default_traits)
	determines if the polygons in the range [poly_first, poly_beyond) define a valid $y$-monotone partition of the simple, counterclockwise-oriented polygon represented by the points in the range [point_first, point_beyond).