My Project: Member List

My Project

dgPolyhedra Member List

This is the complete list of members for dgPolyhedra, including all inherited members.

AddFace(dgInt32 v0, dgInt32 v1, dgInt32 v2) | dgPolyhedra |
AddFace(dgInt32 count, const dgInt32 *const index) | dgPolyhedra |
AddFace(dgInt32 count, const dgInt32 *const index, const dgInt64 *const userdata) | dgPolyhedra |
AddHalfEdge(dgInt32 v0, dgInt32 v1) | dgPolyhedra |
BeginConectedSurface() const | dgPolyhedra |
BeginFace() | dgPolyhedra | virtual
CalculateSphere(const dgFloat64 *const vertex, dgInt32 strideInBytes, const dgMatrix *const basis=NULL) const | dgPolyhedra |
ChangeEdgeIncidentVertex(dgEdge *const edge, dgInt32 newIndex) | dgPolyhedra |
CollapseEdge(dgEdge *const edge) | dgPolyhedra |
ConnectVertex(dgEdge *const e0, dgEdge *const e1) | dgPolyhedra |
ConvexPartition(const dgFloat64 *const vertex, dgInt32 strideInBytes, dgPolyhedra *const leftOversOut) | dgPolyhedra |
DeleteDegenerateFaces(const dgFloat64 *const pool, dgInt32 dstStrideInBytes, dgFloat64 minArea) | dgPolyhedra |
DeleteEdge(dgEdge *const edge) | dgPolyhedra |
DeleteEdge(dgInt32 v0, dgInt32 v1) | dgPolyhedra |
DeleteFace(dgEdge *const edge) | dgPolyhedra | virtual
dgPolyhedra(dgMemoryAllocator *const allocator) | dgPolyhedra |
dgPolyhedra(const dgPolyhedra &polyhedra) | dgPolyhedra |
dgPolyhedraDescriptor class | dgPolyhedra | friend
dgTree(dgMemoryAllocator *const allocator) | dgTree< dgEdge, dgEdgeKey > |
EndConectedSurface() const | dgPolyhedra |
EndFace() | dgPolyhedra | virtual
FaceNormal(const dgEdge *const face, const dgFloat64 *const vertex, dgInt32 strideInBytes) const | dgPolyhedra |
Find(dgEdgeKey key) const | dgTree< dgEdge, dgEdgeKey > |
FindEdge(dgInt32 v0, dgInt32 v1) const | dgPolyhedra |
FindEdgeNode(dgInt32 v0, dgInt32 v1) const | dgPolyhedra |
FindGreater(dgEdgeKey key) const | dgTree< dgEdge, dgEdgeKey > |
FindGreaterEqual(dgEdgeKey key) const | dgTree< dgEdge, dgEdgeKey > |
FindLessEqual(dgEdgeKey key) const | dgTree< dgEdge, dgEdgeKey > |
FlipEdge(dgEdge *const edge) | dgPolyhedra |
GetAllocator() const | dgTree< dgEdge, dgEdgeKey > |
GetConectedSurface(dgPolyhedra &polyhedra) const | dgPolyhedra |
GetCount() const | dgTree< dgEdge, dgEdgeKey > |
GetEdgeCount() const | dgPolyhedra |
GetFaceCount() const | dgPolyhedra |
GetLastVertexIndex() const | dgPolyhedra |
GetNodeFromInfo(dgEdge &info) const | dgTree< dgEdge, dgEdgeKey > |
GetRoot() const | dgTree< dgEdge, dgEdgeKey > |
IncLRU() const | dgPolyhedra |
Insert(const dgEdge &element, dgEdgeKey key, bool &elementWasInTree) | dgTree< dgEdge, dgEdgeKey > |
Insert(const dgEdge &element, dgEdgeKey key) | dgTree< dgEdge, dgEdgeKey > |
Insert(dgTreeNode *const node, dgEdgeKey key) | dgTree< dgEdge, dgEdgeKey > |
Maximum() const | dgTree< dgEdge, dgEdgeKey > |
Minimum() const | dgTree< dgEdge, dgEdgeKey > |
operator dgInt32() const | dgTree< dgEdge, dgEdgeKey > |
Optimize(const dgFloat64 *const pool, dgInt32 strideInBytes, dgReportProgress normalizedProgress, void *const reportProgressUserData, dgFloat64 tol, dgInt32 maxFaceCount=1<< 28) | dgPolyhedra |
PolygonizeFace(dgEdge *face, const dgFloat64 *const pool, dgInt32 stride) | dgPolyhedra |
Remove(dgEdgeKey key) | dgTree< dgEdge, dgEdgeKey > |
Remove(dgTreeNode *const node) | dgTree< dgEdge, dgEdgeKey > |
RemoveAll() | dgTree< dgEdge, dgEdgeKey > |
Replace(dgEdge &element, dgEdgeKey key) | dgTree< dgEdge, dgEdgeKey > |
ReplaceKey(dgEdgeKey oldKey, dgEdgeKey newKey) | dgTree< dgEdge, dgEdgeKey > |
ReplaceKey(dgTreeNode *const node, dgEdgeKey key) | dgTree< dgEdge, dgEdgeKey > |
SanityCheck() const | dgTree< dgEdge, dgEdgeKey > |
SetAllocator(dgMemoryAllocator *const allocator) | dgTree< dgEdge, dgEdgeKey > |
SetLRU(dgInt32 lru) const | dgPolyhedra |
SpliteEdge(dgInt32 newIndex, dgEdge *const edge) | dgPolyhedra |
SwapInfo(dgTree &tree) | dgTree< dgEdge, dgEdgeKey > |
Triangulate(const dgFloat64 *const vertex, dgInt32 strideInBytes, dgPolyhedra *const leftOversOut) | dgPolyhedra |
Unlink(dgTreeNode *const node) | dgTree< dgEdge, dgEdgeKey > |
~dgPolyhedra() | dgPolyhedra | virtual
~dgTree() | dgTree< dgEdge, dgEdgeKey > | virtual