CGAL::Optimal_convex_decomposition_2< Kernel, Container > Class Template Reference

#include <CGAL/Polygon_convex_decomposition_2.h>

Definition

template<typename Kernel, typename Container>
class CGAL::Optimal_convex_decomposition_2< Kernel, Container >

The Optimal_convex_decomposition_2 class provides an implementation of Greene's dynamic programming algorithm for optimal decomposition of a polygon into convex sub-polygons [6]. Note that this algorithm requires \( O(n^4)\) time and \( O(n^3)\) space in the worst case, where \( n\) is the size of the input polygon.

Template Parameters

Kernel	must be a geometric kernel that can be used for the polygon.
Container	must be a container that can be used for the polygon. It is by default std::vector<typename Kernel::Point_2>.

Is Model Of:

PolygonConvexDecomposition_2

See also

CGAL::optimal_convex_partition_2()

Public Types
typedef CGAL::Polygon_2< Kernel, Container >	Polygon_2

Member Typedef Documentation

Polygon_2

template<typename Kernel , typename Container >

typedef CGAL::Polygon_2<Kernel,Container> CGAL::Optimal_convex_decomposition_2< Kernel, Container >::Polygon_2