condition.h

Go to the documentation of this file.

#ifndef REPRESENTATION_FORMAL_BASIC_CONDITION_H
#define REPRESENTATION_FORMAL_BASIC_CONDITION_H

#include <irafhy/utility/definition/enum.h>
#include <irafhy/representation/geometric/intervalHull.h>
#include <irafhy/representation/geometric/polytope.h>
#include <boost/variant.hpp>

namespace irafhy
{
    using GeoEntity = boost::variant<IntervalHull, Polytope>;

    struct geoEntityVisitor : public boost::static_visitor<GeoEntity>
    {
    public:
        GeoEntity operator()(const GeoEntity& geoEntity) const { return geoEntity; }
    };

    class Condition
    {
    private:
        GeoEntity geoEntity_;

    public:
        static Condition Empty(GEOMETRY geometry = GEOMETRY::INTERVAL_HULL, std::size_t dimension = 0);

    public:
        Condition();
        explicit Condition(const std::vector<Point>& points, GEOMETRY geometry);
        explicit Condition(const std::vector<capd::interval>& constraints, GEOMETRY geometry);
        explicit Condition(const GeoEntity& geoEntity);
        Condition(const Point& center, double radius, GEOMETRY geometry);
        Condition(const capd::C0Rect2Set& set, GEOMETRY geometry);
        ~Condition() = default;
        [[nodiscard]] capd::IVector constraints() const;
        [[nodiscard]] GeoEntity entity() const;
        [[nodiscard]] bool empty() const;
        [[nodiscard]] int dimension() const;
        bool intersect(const Condition& rhs, Condition& result) const;
        [[nodiscard]] Condition unite(const Condition& rhs) const;
        [[nodiscard]] Point randInnerPoint() const;
        Point centroid() const;
        [[nodiscard]] bool contains(const Condition& rhs) const;
        [[nodiscard]] bool contains(const Point& point) const;
        [[nodiscard]] std::vector<Point> vertices() const;
        [[nodiscard]] capd::C0Rect2Set set() const;
    };
    std::ostream& operator<<(std::ostream& out, const Condition& rhs);
} // namespace irafhy
#endif //REPRESENTATION_FORMAL_BASIC_CONDITION_H