CGAL 5.4.4 - 2D Polygon Partitioning
|
#include <CGAL/Partition_traits_2.h>
Traits class that can be used with all the 2-dimensional polygon partitioning algorithms.
R | a representation class |
PointPropertyMap | a property map that maps to points of type R::Point_2 |
CGAL::approx_convex_partition_2()
CGAL::convex_partition_is_valid_2()
CGAL::greene_approx_convex_partition_2()
CGAL::optimal_convex_partition_2()
CGAL::partition_is_valid_2()
CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>
CGAL::y_monotone_partition_2()
CGAL::y_monotone_partition_is_valid_2()
Types | |
typedef Partition_traits_2< R, PMap > | Self |
typedef R::FT | FT |
typedef boost::property_traits< PointPropertyMap >::key_type | Point_2 |
typedef std::list< Point_2 > | Container |
typedef CGAL::Polygon_2< Self, Container > | Polygon_2 |
typedef unspecified_type | Less_yx_2 |
A functor with an operator which first obtains points of type R::Point_2 with the function get() applied on the point property map, and then applies the functor of R::Less_yx_2 to these points. | |
typedef unspecified_type | Less_xy_2 |
typedef unspecified_type | Left_turn_2 |
typedef unspecified_type | Orientation_2 |
typedef unspecified_type | Compare_y_2 |
typedef unspecified_type | Compare_x_2 |
typedef unspecified_type | Collinear_are_ordered_along_line_2 |
typedef unspecified_type | Are_strictly_ordered_along_line_2 |
typedef CGAL::Is_convex_2< Self > | Is_convex_2 |
typedef CGAL::Is_y_monotone_2< Self > | Is_y_monotone_2 |
Creation | |
Partition_traits_2 () | |
Partition_traits_2 (Partition_traits_2 &tr) | |
Partition_traits_2 (const R &rep) | |
Partition_traits_2 (const R &rep, PointPropertyMap pmap) | |
Operations | |
For each predicate object type | |
Pred_object_type | pred_object_type_object () |
Returns an instance of Pred_object_type . | |