Newton Dynamics  4.00
ndPolygonSoupBuilder::dgPolySoupFilterAllocator Member List

This is the complete list of members for ndPolygonSoupBuilder::dgPolySoupFilterAllocator, including all inherited members.

AddFace(ndInt32 v0, ndInt32 v1, ndInt32 v2) (defined in ndPolyhedra)ndPolyhedrainline
AddFace(ndInt32 count, const ndInt32 *const index) (defined in ndPolyhedra)ndPolyhedrainline
AddFace(ndInt32 count, const ndInt32 *const index, const ndInt64 *const userdata) (defined in ndPolyhedra)ndPolyhedra
AddFilterFace(ndUnsigned32 count, ndInt32 *const pool) (defined in ndPolygonSoupBuilder::dgPolySoupFilterAllocator)ndPolygonSoupBuilder::dgPolySoupFilterAllocatorinline
AddHalfEdge(ndInt32 v0, ndInt32 v1) (defined in ndPolyhedra)ndPolyhedra
BeginConectedSurface() const (defined in ndPolyhedra)ndPolyhedrainline
BeginFace() (defined in ndPolyhedra)ndPolyhedrainlinevirtual
CalculateSphere(ndBigVector &size, const ndFloat64 *const vertex, ndInt32 strideInBytes) const (defined in ndPolyhedra)ndPolyhedra
ChangeEdgeIncidentVertex(ndEdge *const edge, ndInt32 newIndex) (defined in ndPolyhedra)ndPolyhedra
CollapseEdge(ndEdge *const edge) (defined in ndPolyhedra)ndPolyhedraprotected
ConnectVertex(ndEdge *const e0, ndEdge *const e1) (defined in ndPolyhedra)ndPolyhedra
ConvexPartition(const ndFloat64 *const vertex, ndInt32 strideInBytes, ndPolyhedra *const leftOversOut) (defined in ndPolyhedra)ndPolyhedra
DeleteDegenerateFaces(const ndFloat64 *const pool, ndInt32 dstStrideInBytes, ndFloat64 minArea) (defined in ndPolyhedra)ndPolyhedra
DeleteEdge(ndEdge *const edge) (defined in ndPolyhedra)ndPolyhedra
DeleteEdge(ndInt32 v0, ndInt32 v1) (defined in ndPolyhedra)ndPolyhedrainline
DeleteFace(ndEdge *const edge) (defined in ndPolyhedra)ndPolyhedravirtual
dgPolySoupFilterAllocator() (defined in ndPolygonSoupBuilder::dgPolySoupFilterAllocator)ndPolygonSoupBuilder::dgPolySoupFilterAllocatorinline
EndConectedSurface() const (defined in ndPolyhedra)ndPolyhedrainline
EndFace() (defined in ndPolyhedra)ndPolyhedravirtual
FaceNormal(const ndEdge *const face, const ndFloat64 *const vertex, ndInt32 strideInBytes) const (defined in ndPolyhedra)ndPolyhedra
Find(const ndEdgeKey &key) const (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
FindCreate(const ndEdgeKey &key, bool &wasFound) (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
FindEdge(ndInt32 v0, ndInt32 v1) const (defined in ndPolyhedra)ndPolyhedrainline
FindEdgeNode(ndInt32 v0, ndInt32 v1) const (defined in ndPolyhedra)ndPolyhedrainline
FindGreater(const ndEdgeKey &key) const (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
FindGreaterEqual(const ndEdgeKey &key) const (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
FindLessEqual(const ndEdgeKey &key) const (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
FlipEdge(ndEdge *const edge) (defined in ndPolyhedra)ndPolyhedra
FlushFreeList() (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >inlinestatic
Free(void *const ptr)ndClassAllocstatic
GetConectedSurface(ndPolyhedra &polyhedra) const (defined in ndPolyhedra)ndPolyhedra
GetCount() const (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
GetEdgeCount() const (defined in ndPolyhedra)ndPolyhedrainline
GetFaceCount() const (defined in ndPolyhedra)ndPolyhedra
GetLastVertexIndex() const (defined in ndPolyhedra)ndPolyhedrainline
GetLRU() const (defined in ndPolyhedra)ndPolyhedrainline
GetNodeFromInfo(ndEdge &info) const (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
GetRoot() const (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
IncLRU() const (defined in ndPolyhedra)ndPolyhedrainline
Insert(const ndEdgeKey &key) (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
Insert(ndNode *const node, const ndEdgeKey &key) (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
Insert(const ndEdge &element, const ndEdgeKey &key) (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
Insert(const ndEdge &element, const ndEdgeKey &key, bool &wasFound) (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
IsFaceConvex(ndEdge *const face, const ndFloat64 *const pool, ndInt32 strideInBytes) const (defined in ndPolyhedra)ndPolyhedra
Malloc(size_t size)ndClassAllocstatic
Maximum() const (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
Minimum() const (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
ndClassAlloc()ndClassAllocinline
ndPolyhedra() (defined in ndPolyhedra)ndPolyhedrainline
ndPolyhedra(const ndPolyhedra &polyhedra) (defined in ndPolyhedra)ndPolyhedra
ndTree() (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
operator ndInt32() const (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
Optimize(const ndFloat64 *const pool, ndInt32 strideInBytes, ndFloat64 tol, ndInt32 maxFaceCount=1<< 28) (defined in ndPolyhedra)ndPolyhedra
PolygonizeFace(ndEdge *const face, const ndFloat64 *const pool, ndInt32 stride) (defined in ndPolyhedra)ndPolyhedraprotected
Remove(const ndEdgeKey &key) (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
Remove(ndNode *const node) (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
RemoveAll() (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
Replace(ndEdge &element, const ndEdgeKey &key) (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
ReplaceKey(const ndEdgeKey &oldKey, const ndEdgeKey &newKey) (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
ReplaceKey(ndNode *const node, const ndEdgeKey &key) (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
ReportProgress(ndFloat32) const (defined in ndPolyhedra)ndPolyhedrainlinevirtual
SanityCheck() const (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
SavePLY(const char *const fileName, const ndFloat64 *const vertex, ndInt32 strideInBytes) const (defined in ndPolyhedra)ndPolyhedra
SetLRU(ndInt32 lru) const (defined in ndPolyhedra)ndPolyhedrainline
SpliteEdge(ndInt32 newIndex, ndEdge *const edge) (defined in ndPolyhedra)ndPolyhedra
SwapInfo(ndTree &tree) (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
Triangulate(const ndFloat64 *const vertex, ndInt32 strideInBytes, ndPolyhedra *const leftOversOut) (defined in ndPolyhedra)ndPolyhedra
TriangulateFace(ndEdge *const face, const ndFloat64 *const pool, ndInt32 stride) (defined in ndPolyhedra)ndPolyhedraprotected
Unlink(ndNode *const node) (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >
~dgPolySoupFilterAllocator() (defined in ndPolygonSoupBuilder::dgPolySoupFilterAllocator)ndPolygonSoupBuilder::dgPolySoupFilterAllocatorinline
~ndClassAlloc()ndClassAllocinline
~ndPolyhedra() (defined in ndPolyhedra)ndPolyhedravirtual
~ndTree() (defined in ndTree< ndEdge, ndEdgeKey >)ndTree< ndEdge, ndEdgeKey >