16 #ifndef VHACD_ICHULL_H 17 #define VHACD_ICHULL_H 70 bool ComputePointVolume(
double& totalVolume,
bool markVisibleFaces);
72 bool FindMaxVolumePoint(
const double minVolume = 0.0);
76 bool CleanVertices(uint32_t& addedPoints);
78 bool CleanTriangles();
80 bool CleanUp(uint32_t& addedPoints);
88 static const int32_t sc_dummyIndex;
98 #endif // VHACD_ICHULL_H bool IsFlat()
Definition: vhacdICHull.h:34
ICHullError
Incremental Convex Hull algorithm (cf. http://cs.smith.edu/~orourke/books/ftp.html )...
Definition: vhacdICHull.h:23
Definition: vhacdICHull.h:25
triangular manifold mesh data structure.
Definition: vhacdManifoldMesh.h:87
Definition: vhacdICHull.h:24
bool AddPoint(const Vec3< double > &point)
Add one point to the convex-hull.
Definition: vhacdICHull.h:38
SArray.
Definition: vhacdSArray.h:27
CircularListElement class.
Definition: vhacdCircularList.h:22
const ICHull & operator=(ICHull &rhs)
Definition: vhacdICHull.h:28
Definition: vhacdCircularList.h:19
Definition: vhacdICHull.h:27
~ICHull(void)
Destructor.
Definition: vhacdICHull.h:55
TMMesh & GetMesh()
Returns the computed mesh.
Definition: vhacdICHull.h:36
Definition: vhacdICHull.h:26
bool IsInside(const Vec3< double > &pt0, const double eps=0.0)
Definition: vhacdICHull.h:30
bool AddPoints(const Vec3< double > *points, size_t nPoints)
Add points to the convex-hull.
static const double sc_eps
Definition: vhacdICHull.h:32