rpolygon_cut.hpp

Go to the documentation of this file.

 
#pragma once
 
#include <span>
#include <vector>
 
#include "point.hpp"
 
// Forward declaration for recursive functions
class RDllist;
template <typename T> class Dllink;
 
namespace recti {
 
    template <typename T, typename Cmp>
    auto rpolygon_cut_convex_recur(Dllink<size_t>* v1, std::vector<Point<T>>& lst, const Cmp& cmp,
                                   RDllist& rdll) -> std::vector<std::vector<size_t>>;
 
    template <typename T, typename Cmp>
    auto rpolygon_cut_explicit_recur(Dllink<size_t>* v1, std::vector<Point<T>>& lst, const Cmp& cmp,
                                     RDllist& rdll) -> std::vector<std::vector<size_t>>;
 
    template <typename T, typename Cmp>
    auto rpolygon_cut_implicit_recur(Dllink<size_t>* v1, std::vector<Point<T>>& lst, const Cmp& cmp,
                                     RDllist& rdll) -> std::vector<std::vector<size_t>>;
 
    template <typename T>
    auto rpolygon_cut_convex(std::span<const Point<T>> pointset, bool is_anticlockwise)
        -> std::vector<std::vector<Point<T>>>;
 
    template <typename T>
    auto rpolygon_cut_explicit(std::span<const Point<T>> pointset, bool is_anticlockwise)
        -> std::vector<std::vector<Point<T>>>;
 
    template <typename T>
    auto rpolygon_cut_implicit(std::span<const Point<T>> pointset, bool is_anticlockwise)
        -> std::vector<std::vector<Point<T>>>;
 
    template <typename T>
    auto rpolygon_cut_rectangle(std::span<const Point<T>> pointset, bool is_anticlockwise)
        -> std::vector<std::vector<Point<T>>>;
 
}  // namespace recti