HyperplaneEnumeration.h

Go to the documentation of this file.

#pragma once
 
#include <vector>
#include "storm/adapters/EigenAdapter.h"
 
namespace storm {
namespace storage {
namespace geometry {
 
template<typename ValueType>
class HyperplaneEnumeration {
   public:
    typedef Eigen::Matrix<ValueType, Eigen::Dynamic, Eigen::Dynamic> EigenMatrix;
    typedef Eigen::Matrix<ValueType, Eigen::Dynamic, 1> EigenVector;
 
    HyperplaneEnumeration() = default;
    virtual ~HyperplaneEnumeration() = default;
 
    /*
     * Generates the vertices of the given polytope by enumerating all intersection points generated by subsets of hyperplanes of size hPoly.dimension().
     * If the given flag is true, this method will also compute
     *  * the minimal set of hyperplanes which represent the given hPoly (can be used to remove redundant hyperplanes), and
     *  * for each hyperplane, the set of (non-redundant) vertices that lie on that hyperplane.
     *
     * Use the provided getter methods to retrieve the results
     *
     * @return true iff conversion was successful.
     */
    void generateVerticesFromConstraints(EigenMatrix const& constraintMatrix, EigenVector const& constraintVector,
                                         bool generateRelevantHyperplanesAndVertexSets);
 
    std::vector<EigenVector>& getResultVertices();

    EigenMatrix& getRelevantMatrix();
    EigenVector& getRelevantVector();

    std::vector<std::vector<uint_fast64_t>>& getVertexSets();
 
    /*
     * Returns true if the hyperplanes with indices of subset and item are all linear independent
     * Note that this is also used by the hybrid polytope.
     */
    static bool linearDependenciesFilter(std::vector<uint_fast64_t> const& subset, uint_fast64_t const& item, EigenMatrix const& A);
 
   private:
    std::vector<EigenVector> resultVertices;
    EigenMatrix relevantMatrix;
    EigenVector relevantVector;
    std::vector<std::vector<uint_fast64_t>> vertexSets;
};
}  // namespace geometry
}  // namespace storage
}  // namespace storm