utils.cpp File Reference

#include <hpp/bezier-com-traj/utils.hh>

Include dependency graph for utils.cpp:

Namespaces
namespace	bezier_com_traj

Functions
waypoint_t	bezier_com_traj::initwp (const size_t rows, const size_t cols)
waypoint_t	bezier_com_traj::operator+ (const waypoint_t &w1, const waypoint_t &w2)
waypoint_t	bezier_com_traj::operator- (const waypoint_t &w1, const waypoint_t &w2)
waypoint_t	bezier_com_traj::operator* (const double k, const waypoint_t &w)
waypoint_t	bezier_com_traj::operator* (const waypoint_t &w, const double k)
template<>
waypoint9_t	bezier_com_traj::initwp< waypoint9_t > ()
template<>
waypoint6_t	bezier_com_traj::initwp< waypoint6_t > ()
template<>
waypoint3_t	bezier_com_traj::initwp< waypoint3_t > ()
BEZIER_COM_TRAJ_DLLAPI Matrix3	bezier_com_traj::skew (point_t_tC x)
	skew symmetric matrix
BEZIER_COM_TRAJ_DLLAPI std::vector< ndcurves::Bern< double > >	bezier_com_traj::ComputeBersteinPolynoms (const unsigned int degree)
	Compute the Bernstein polynoms for a given degree.
T_time	bezier_com_traj::computeDiscretizedTimeFixed (const VectorX &phaseTimings, const unsigned int pointsPerPhase)
	computeDiscretizedTime build an array of discretized points in time, such that there is the same number of point in each phase. Doesn't contain t=0, is of size pointsPerPhase*phaseTimings.size()
T_time	bezier_com_traj::computeDiscretizedTime (const VectorX &phaseTimings, const double timeStep)
	computeDiscretizedTime build an array of discretized points in time, given the timestep. Doesn't contain t=0, is of size pointsPerPhase*phaseTimings.size()
void	bezier_com_traj::printQHullFile (const std::pair< MatrixXX, VectorX > &Ab, VectorX intPoint, const std::string &fileName, bool clipZ=false)
	write a polytope describe by A x <= b linear constraints in a given filename