#include <Mathematics/ConvexHull.hh>
Public Member Functions | |
ComputeConvexHull () | |
~ComputeConvexHull () | |
void | DoComputeConvexHull (std::vector< CH_Point > aVecOfPoints, std::vector< CH_Point > &TheConvexHull) |
This class compute the convex hull in 2D.
void PatternGeneratorJRL::ComputeConvexHull::DoComputeConvexHull | ( | std::vector< CH_Point > | aVecOfPoints, |
std::vector< CH_Point > & | TheConvexHull | ||
) |
Compute the convex hull by applying Graham's algorithm.
aVecOfPoints,: | The set of 2D points on which the convex hull is computed. |
TheConvexHull,: | The set of 2D points which give the convex hull. |
References PatternGeneratorJRL::CH_Point::col, PatternGeneratorJRL::CompareCBRep(), PatternGeneratorJRL::DistanceCHRep(), PatternGeneratorJRL::HRP2CIO_GlobalP0, and PatternGeneratorJRL::CH_Point::row.
Referenced by PatternGeneratorJRL::FootConstraintsAsLinearSystem::BuildLinearConstraintInequalities().