// Copyright (c) 2006 Tel-Aviv University (Israel). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL$ // $Id$ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // Author(s) : Ron Wein #ifndef CGAL_POLYGON_CONVEX_DECOMPOSITION_H #define CGAL_POLYGON_CONVEX_DECOMPOSITION_H #include #include #include namespace CGAL { /*! * \class * The \cgalBigO{n^4} optimal strategy for decomposing a polygon into convex * sub-polygons. */ template > class Optimal_convex_decomposition_2 : public Polygon_decomposition_strategy_adapter { public: typedef Kernel_ Kernel; typedef CGAL::Polygon_2 Polygon_2; typedef typename Kernel::Point_2 Point_2; }; /*! * \class * Hertel and Mehlhorn's \cgalBigO{n} approximation strategy for decomposing a * polygon into convex sub-polygons. */ template > class Hertel_Mehlhorn_convex_decomposition_2 : public Polygon_decomposition_strategy_adapter { public: typedef Kernel_ Kernel; typedef CGAL::Polygon_2 Polygon_2; typedef typename Kernel::Point_2 Point_2; }; /*! * \class * Greene's \cgalBigO{n log(n)} approximation strategy for decomposing a polygon into * convex sub-polygons. */ template > class Greene_convex_decomposition_2 : public Polygon_decomposition_strategy_adapter { public: typedef Kernel_ Kernel; typedef CGAL::Polygon_2 Polygon_2; typedef typename Kernel::Point_2 Point_2; }; } //namespace CGAL #endif