bestfit.h

Go to the documentation of this file.

#ifndef BEST_FIT_H

#define BEST_FIT_H

// This routine was released in 'snippet' form
// by John W. Ratcliff mailto:jratcliff@infiniplex.net
// on March 22, 2006.
//
// This routine computes the 'best fit' plane equation to
// a set of input data points with an optional per vertex
// weighting component.
//
// The implementation for this was lifted directly from
// David Eberly's Magic Software implementation.

// computes the best fit plane to a collection of data points.
// returns the plane equation as A,B,C,D format. (Ax+By+Cz+D)

namespace ConvexDecomposition
{


bool getBestFitPlane(unsigned int vcount,     // number of input data points
                     const double *points,     // starting address of points array.
                     unsigned int vstride,    // stride between input points.
                     const double *weights,    // *optional point weighting values.
                     unsigned int wstride,    // weight stride for each vertex.
                     double *plane);


double getBoundingRegion(unsigned int vcount,const double *points,unsigned int pstride,double *bmin,double *bmax); // returns the diagonal distance
bool  overlapAABB(const double *bmin1,const double *bmax1,const double *bmin2,const double *bmax2); // return true if the two AABB's overlap.

};

#endif