Newton Dynamics  4.00
dPolyhedra Member List

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

AddFace(dInt32 v0, dInt32 v1, dInt32 v2) (defined in dPolyhedra)dPolyhedrainline
AddFace(dInt32 count, const dInt32 *const index) (defined in dPolyhedra)dPolyhedrainline
AddFace(dInt32 count, const dInt32 *const index, const dInt64 *const userdata) (defined in dPolyhedra)dPolyhedra
AddHalfEdge(dInt32 v0, dInt32 v1) (defined in dPolyhedra)dPolyhedra
BeginConectedSurface() const (defined in dPolyhedra)dPolyhedrainline
BeginFace() (defined in dPolyhedra)dPolyhedrainlinevirtual
ChangeEdgeIncidentVertex(dEdge *const edge, dInt32 newIndex) (defined in dPolyhedra)dPolyhedra
CollapseEdge(dEdge *const edge) (defined in dPolyhedra)dPolyhedraprotected
ConnectVertex(dEdge *const e0, dEdge *const e1) (defined in dPolyhedra)dPolyhedra
ConvexPartition(const dFloat64 *const vertex, dInt32 strideInBytes, dPolyhedra *const leftOversOut) (defined in dPolyhedra)dPolyhedra
dClassAlloc()dClassAllocinline
DeleteDegenerateFaces(const dFloat64 *const pool, dInt32 dstStrideInBytes, dFloat64 minArea) (defined in dPolyhedra)dPolyhedra
DeleteEdge(dEdge *const edge) (defined in dPolyhedra)dPolyhedra
DeleteEdge(dInt32 v0, dInt32 v1) (defined in dPolyhedra)dPolyhedrainline
DeleteFace(dEdge *const edge) (defined in dPolyhedra)dPolyhedravirtual
dPolyhedra() (defined in dPolyhedra)dPolyhedrainline
dPolyhedra(const dPolyhedra &polyhedra) (defined in dPolyhedra)dPolyhedra
dPolyhedraDescriptor (defined in dPolyhedra)dPolyhedrafriend
dTree() (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
EndConectedSurface() const (defined in dPolyhedra)dPolyhedrainline
EndFace() (defined in dPolyhedra)dPolyhedravirtual
FaceNormal(const dEdge *const face, const dFloat64 *const vertex, dInt32 strideInBytes) const (defined in dPolyhedra)dPolyhedra
Find(dEdgeKey key) const (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
FindCreate(dEdgeKey key, bool &wasFound) (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
FindEdge(dInt32 v0, dInt32 v1) const (defined in dPolyhedra)dPolyhedrainline
FindEdgeNode(dInt32 v0, dInt32 v1) const (defined in dPolyhedra)dPolyhedrainline
FindGreater(dEdgeKey key) const (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
FindGreaterEqual(dEdgeKey key) const (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
FindLessEqual(dEdgeKey key) const (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
FlipEdge(dEdge *const edge) (defined in dPolyhedra)dPolyhedra
FlushFreeList() (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >inlinestatic
Free(void *const ptr)dClassAllocstatic
GetConectedSurface(dPolyhedra &polyhedra) const (defined in dPolyhedra)dPolyhedra
GetCount() const (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
GetEdgeCount() const (defined in dPolyhedra)dPolyhedrainline
GetFaceCount() const (defined in dPolyhedra)dPolyhedra
GetLastVertexIndex() const (defined in dPolyhedra)dPolyhedrainline
GetLRU() const (defined in dPolyhedra)dPolyhedrainline
GetNodeFromInfo(dEdge &info) const (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
GetRoot() const (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
IncLRU() const (defined in dPolyhedra)dPolyhedrainline
Insert(const dEdge &element, dEdgeKey key, bool &wasFound) (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
Insert(const dEdge &element, dEdgeKey key) (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
Insert(dTreeNode *const node, dEdgeKey key) (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
IsFaceConvex(dEdge *const face, const dFloat64 *const pool, dInt32 strideInBytes) const (defined in dPolyhedra)dPolyhedra
Malloc(size_t size)dClassAllocstatic
Maximum() const (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
Minimum() const (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
operator delete(void *ptr)dClassAllocinline
operator dInt32() const (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
operator new(size_t size)dClassAllocinline
Optimize(const dFloat64 *const pool, dInt32 strideInBytes, dFloat64 tol, dInt32 maxFaceCount=1<< 28) (defined in dPolyhedra)dPolyhedra
PolygonizeFace(dEdge *const face, const dFloat64 *const pool, dInt32 stride) (defined in dPolyhedra)dPolyhedraprotected
Remove(dEdgeKey key) (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
Remove(dTreeNode *const node) (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
RemoveAll() (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
Replace(dEdge &element, dEdgeKey key) (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
ReplaceKey(dEdgeKey oldKey, dEdgeKey newKey) (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
ReplaceKey(dTreeNode *const node, dEdgeKey key) (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
ReportProgress(dFloat32 percentProgress) const (defined in dPolyhedra)dPolyhedrainlinevirtual
SanityCheck() const (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
SavePLY(const char *const fileName, const dFloat64 *const vertex, dInt32 strideInBytes) const (defined in dPolyhedra)dPolyhedra
SetLRU(dInt32 lru) const (defined in dPolyhedra)dPolyhedrainline
SpliteEdge(dInt32 newIndex, dEdge *const edge) (defined in dPolyhedra)dPolyhedra
SwapInfo(dTree &tree) (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
Triangulate(const dFloat64 *const vertex, dInt32 strideInBytes, dPolyhedra *const leftOversOut) (defined in dPolyhedra)dPolyhedra
TriangulateFace(dEdge *const face, const dFloat64 *const pool, dInt32 stride) (defined in dPolyhedra)dPolyhedraprotected
Unlink(dTreeNode *const node) (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >
~dClassAlloc()dClassAllocinline
~dPolyhedra() (defined in dPolyhedra)dPolyhedravirtual
~dTree() (defined in dTree< dEdge, dEdgeKey >)dTree< dEdge, dEdgeKey >