$search

cd_hull.h

Go to the documentation of this file.

#ifndef HULL_LIB_H

#define HULL_LIB_H


namespace ConvexDecomposition
{

class HullResult
{
public:
        HullResult(void)
        {
                mPolygons = true;
                mNumOutputVertices = 0;
                mOutputVertices = 0;
                mNumFaces = 0;
                mNumIndices = 0;
                mIndices = 0;
        }
        bool                    mPolygons;                  // true if indices represents polygons, false indices are triangles
        unsigned int            mNumOutputVertices;         // number of vertices in the output hull
        double                  *mOutputVertices;            // array of vertices, 3 doubles each x,y,z
        unsigned int            mNumFaces;                  // the number of faces produced
        unsigned int            mNumIndices;                // the total number of indices
        unsigned int           *mIndices;                   // pointer to indices.

// If triangles, then indices are array indexes into the vertex list.
// If polygons, indices are in the form (number of points in face) (p1, p2, p3, ..) etc..
};

class FHullResult
{
public:
        FHullResult(const HullResult &r)
        {
    mPolygons          = r.mPolygons;
    mNumOutputVertices = r.mNumOutputVertices;
    mNumFaces          = r.mNumFaces;
    mNumIndices        = r.mNumIndices;
    mIndices           = 0;
    mOutputVertices    = 0;
    if ( mNumIndices )
    {
      mIndices = new unsigned int[mNumIndices];
      memcpy(mIndices,r.mIndices,sizeof(unsigned int)*mNumIndices);
    }
    if ( mNumOutputVertices )
    {
      mOutputVertices = new float[mNumOutputVertices*3];
      const double *src = r.mOutputVertices;
      float        *dst = mOutputVertices;
      for (unsigned int i=0; i<mNumOutputVertices; i++)
      {
        dst[0] = (float) src[0];
        dst[1] = (float) src[1];
        dst[2] = (float) src[2];
        dst+=3;
        src+=3;
      }
    }
        }
  ~FHullResult(void)
  {
    delete mIndices;
    delete mOutputVertices;
  }
        bool                    mPolygons;                  // true if indices represents polygons, false indices are triangles
        unsigned int            mNumOutputVertices;         // number of vertices in the output hull
        float                  *mOutputVertices;            // array of vertices, 3 doubles each x,y,z
        unsigned int            mNumFaces;                  // the number of faces produced
        unsigned int            mNumIndices;                // the total number of indices
        unsigned int           *mIndices;                   // pointer to indices.

// If triangles, then indices are array indexes into the vertex list.
// If polygons, indices are in the form (number of points in face) (p1, p2, p3, ..) etc..
};

enum HullFlag
{
        QF_TRIANGLES         = (1<<0),             // report results as triangles, not polygons.
        QF_REVERSE_ORDER     = (1<<1),             // reverse order of the triangle indices.
        QF_SKIN_WIDTH        = (1<<2),             // extrude hull based on this skin width
        QF_DEFAULT           = 0
};


class HullDesc
{
public:
        HullDesc(void)
        {
                mFlags          = QF_DEFAULT;
                mVcount         = 0;
                mVertices       = 0;
                mVertexStride   = 0;
                mNormalEpsilon  = 0.001f;
                mMaxVertices = 4096; // maximum number of points to be considered for a convex hull.
                mSkinWidth = 0.01f; // default is one centimeter
        };

        HullDesc(HullFlag flag,
                                                 unsigned int vcount,
                                                 const double *vertices,
                                                 unsigned int stride)
        {
                mFlags          = flag;
                mVcount         = vcount;
                mVertices       = vertices;
                mVertexStride   = stride;
                mNormalEpsilon  = 0.001f;
                mMaxVertices    = 4096;
                mSkinWidth = 0.01f; // default is one centimeter
        }

        bool HasHullFlag(HullFlag flag) const
        {
                if ( mFlags & flag ) return true;
                return false;
        }

        void SetHullFlag(HullFlag flag)
        {
                mFlags|=flag;
        }

        void ClearHullFlag(HullFlag flag)
        {
                mFlags&=~flag;
        }

        unsigned int      mFlags;           // flags to use when generating the convex hull.
        unsigned int      mVcount;          // number of vertices in the input point cloud
        const double      *mVertices;        // the array of vertices.
        unsigned int      mVertexStride;    // the stride of each vertex, in bytes.
        double             mNormalEpsilon;   // the epsilon for removing duplicates.  This is a normalized value, if normalized bit is on.
        double             mSkinWidth;
        unsigned int      mMaxVertices;               // maximum number of vertices to be considered for the hull!
};

enum HullError
{
        QE_OK,            // success!
        QE_FAIL           // failed.
};

// This class is used when converting a convex hull into a triangle mesh.
class ConvexHullVertex
{
public:
        double         mPos[3];
        double         mNormal[3];
        double         mTexel[2];
};

// A virtual interface to receive the triangles from the convex hull.
class ConvexHullTriangleInterface
{
public:
        virtual void ConvexHullTriangle(const ConvexHullVertex &v1,const ConvexHullVertex &v2,const ConvexHullVertex &v3) = 0;
};



class HullLibrary
{
public:

        HullError CreateConvexHull(const HullDesc       &desc,           // describes the input request
                                                                                                                        HullResult           &result);        // contains the resulst

        HullError ReleaseResult(HullResult &result); // release memory allocated for this result, we are done with it.

        // Utility function to convert the output convex hull as a renderable set of triangles. Unfolds the polygons into
        // individual triangles, compute the vertex normals, and projects some texture co-ordinates.
        HullError CreateTriangleMesh(HullResult &answer,ConvexHullTriangleInterface *iface);
private:
        double ComputeNormal(double *n,const double *A,const double *B,const double *C);
        void AddConvexTriangle(ConvexHullTriangleInterface *callback,const double *p1,const double *p2,const double *p3);

        void BringOutYourDead(const double *verts,unsigned int vcount, double *overts,unsigned int &ocount,unsigned int *indices,unsigned indexcount);

        bool    CleanupVertices(unsigned int svcount,
                                                                                                        const double *svertices,
                                                                                                        unsigned int stride,
                                                                                                        unsigned int &vcount,       // output number of vertices
                                                                                                        double *vertices,                 // location to store the results.
                                                                                                        double  normalepsilon,
                                                                                                        double *scale);
};

};

#endif

---

convex_decomposition
Author(s): John Ratcliff
autogenerated on Tue Mar 5 12:17:26 2013