File vpolytope.h

template<typename Point>
class VPolytope

#include <vpolytope.h>

This class describes a polytope in V-representation or an V-polytope i.e. a polytope defined as a convex combination of points

Template Parameters:

Point – Point type

Public Types

typedef Point PointType

typedef Point::FT NT

typedef Eigen::Matrix<NT, Eigen::Dynamic, Eigen::Dynamic> MT

typedef Eigen::Matrix<NT, Eigen::Dynamic, 1> VT

Public Functions

inline VPolytope()

inline VPolytope(const unsigned int &dim, const MT &_V, const VT &_b)

inline VPolytope(std::vector<std::vector<NT>> const &Pin)

template<typename T>
inline void copy_array(T *source, T *result, size_t count)

inline VPolytope &operator=(const VPolytope &other)

inline VPolytope &operator=(VPolytope &&other)

inline VPolytope(const VPolytope &other)

inline VPolytope(VPolytope &&other)

inline ~VPolytope()

inline std::pair<Point, NT> InnerBall() const

inline void set_InnerBall(std::pair<Point, NT> const &innerball)

inline void set_interior_point(Point const &r)

inline unsigned int dimension() const

inline int num_of_hyperplanes() const

inline int num_of_generators() const

inline unsigned int upper_bound_of_hyperplanes() const

inline int num_of_vertices() const

inline MT get_mat() const

inline VT get_vec() const

inline VT get_row(int vertex_index) const

inline bool is_normalized()

inline void set_mat(const MT &V2)

inline void set_vec(const VT &b2)

inline MT get_T() const

inline void print()

inline Point get_mean_of_vertices()

inline NT get_max_vert_norm()

inline void normalize()

inline std::pair<Point, NT> get_center_radius_inscribed_simplex(const typename std::vector<Point>::iterator it_beg, const typename std::vector<Point>::iterator it_end)

inline std::pair<Point, NT> ComputeInnerBall()

inline int is_in(const Point &p, NT tol = NT(0)) const

inline std::pair<NT, NT> line_intersect(const Point &r, const Point &v) const

inline std::pair<NT, NT> line_intersect(const Point &r, const Point &v, const VT &Ar, const VT &Av) const

inline std::pair<NT, NT> line_intersect(const Point &r, const Point &v, const VT &Ar, const VT &Av, const NT &lambda_prev) const

inline std::pair<NT, int> line_positive_intersect(const Point &r, const Point &v) const

inline std::pair<NT, int> line_positive_intersect(const Point &r, const Point &v, const VT &Ar, const VT &Av) const

inline std::pair<NT, int> line_positive_intersect(const Point &r, const Point &v, const VT &Ar, const VT &Av, const NT &lambda_prev) const

template<typename update_parameters>
inline std::pair<NT, int> line_first_positive_intersect(Point const &r, Point const &v, VT &Ar, VT &Av, update_parameters &params) const

template<typename update_parameters>
inline std::pair<NT, int> line_positive_intersect(Point const &r, Point const &v, VT &Ar, VT &Av, NT const &lambda_prev, MT const &AA, update_parameters &params) const

template<typename update_parameters>
inline std::pair<NT, int> line_positive_intersect(Point const &r, Point const &v, VT &Ar, VT &Av, NT const &lambda_prev, update_parameters &params) const

inline std::pair<NT, NT> line_intersect_coord(const Point &r, const unsigned int rand_coord, const VT &lamdas) const

inline std::pair<NT, NT> line_intersect_coord(const Point &r, const Point &r_prev, const unsigned int rand_coord, const unsigned int rand_coord_prev, const VT &lamdas) const

inline std::pair<NT, int> quadratic_positive_intersect(Point const &r, Point const &v, VT const &Ac, NT const &T, VT &Ar, VT &Av, int &facet_prev) const

inline std::pair<NT, int> quadratic_positive_intersect(Point const &r, Point const &v, VT const &Ac, NT const &T, VT &Ar, VT &Av, NT const &lambda_prev, int &facet_prev) const

inline std::pair<NT, int> trigonometric_positive_intersect(Point const &r, Point const &v, NT const &omega, int &facet_prev) const

inline void shift(const VT &c)

inline void linear_transformIt(const MT &T)

inline std::vector<NT> get_dists(const NT &radius) const

template<class PointList>
inline bool get_points_for_rounding(PointList &randPoints)

inline void compute_reflection(Point &v, const Point &p, const int &facet) const

template<typename update_parameters>
inline void compute_reflection(Point &v, const Point &p, update_parameters const &params) const

inline void resetFlags()

inline void update_position_internal(NT&)

template<class bfunc, class NonLinearOracle>
inline std::tuple<NT, Point, int> curve_intersect(NT t_prev, NT t0, NT eta, std::vector<Point> &coeffs, bfunc phi, bfunc grad_phi, NonLinearOracle &intersection_oracle, int ignore_facet = -1)

Private Members

unsigned int _d

MT V

VT b

std::pair<Point, NT> _inner_ball

REAL *conv_comb

REAL *conv_comb2

REAL *conv_mem

REAL *row

int *colno

int *colno_mem