33 #ifndef DART_CONSTRAINT_DANTZIGLCPSOLVER_HPP_
34 #define DART_CONSTRAINT_DANTZIGLCPSOLVER_HPP_
38 #include "dart/config.hpp"
42 namespace constraint {
64 bool isSymmetric(std::size_t _n,
double* _A, std::size_t _begin, std::size_t _end);
67 void print(std::size_t _n,
double* _A,
double* _x,
double* _lo,
double* _hi,
68 double* _b,
double* w,
int* _findex);
ConstrainedGroup is a group of skeletons that interact each other with constraints.
Definition: ConstrainedGroup.hpp:58
DantzigLCPSolver is a LCP solver that uses ODE's implementation of Dantzig algorithm.
Definition: DantzigLCPSolver.hpp:47
virtual ~DantzigLCPSolver()
Constructor.
Definition: DantzigLCPSolver.cpp:56
DantzigLCPSolver(double _timestep)
Constructor.
Definition: DantzigLCPSolver.cpp:51
void solve(ConstrainedGroup *_group) override
Solve constriant impulses for a constrained group.
Definition: DantzigLCPSolver.cpp:61
void print(std::size_t _n, double *_A, double *_x, double *_lo, double *_hi, double *_b, double *w, int *_findex)
Print debug information.
Definition: DantzigLCPSolver.cpp:253
bool isSymmetric(std::size_t _n, double *_A)
Return true if the matrix is symmetric.
Definition: DantzigLCPSolver.cpp:192
LCPSolver.
Definition: LCPSolver.hpp:43
Definition: BulletCollisionDetector.cpp:63