My Project: Member List

My Project

dgHACDClusterGraph Member List

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

AddNode() | dgGraph< dgHACDCluster, dgHACDEdge > |
Addtop() | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
Addtop(dgListNode *const node) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
Addtop(const dgGraphNode< dgHACDCluster, dgHACDEdge > &element) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
Append() | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
Append(dgListNode *const node) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
Append(const dgGraphNode< dgHACDCluster, dgHACDEdge > &element) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
CalculateClusterPerimeter(dgMeshEffect &mesh, dgInt32 mark, const dgHACDCluster &cluster, dgInt32 colorA, dgInt32 colorB) const | dgHACDClusterGraph | inline
CalculateConcavity(dgHACDConveHull &hull, const dgMeshEffect &mesh, const dgHACDCluster &cluster) | dgHACDClusterGraph | inline
CalculateConcavity(dgHACDConveHull &hull, dgMeshEffect &mesh, dgHACDCluster &clusterA, dgHACDCluster &clusterB) | dgHACDClusterGraph | inline
CalculateConcavityMetric(dgFloat64 convexConcavity, dgFloat64 area, dgFloat64 perimeter, dgInt32 faceCountA, dgInt32 faceCountB) const | dgHACDClusterGraph | inline
CollapseClusters(dgMeshEffect &mesh, dgFloat64 maxConcavity___, dgInt32 maxClustesCount) | dgHACDClusterGraph | inline
CollapseEdge(dgList< dgPairProxy >::dgListNode *const pairNode, dgMeshEffect &mesh, dgFloat64 concavity) | dgHACDClusterGraph | inline
ConcavityByFaceMedian(dgInt32 faceCountA, dgInt32 faceCountB) const | dgHACDClusterGraph | inline
CopyVertexToPool(const dgMeshEffect &mesh, const dgHACDCluster &cluster, dgInt32 start) | dgHACDClusterGraph | inline
CreatePartitionMesh(dgMeshEffect &mesh, dgInt32 maxVertexPerHull) | dgHACDClusterGraph | inline
DeleteNode(typename dgGraph< dgHACDCluster, dgHACDEdge >::dgListNode *const node) | dgGraph< dgHACDCluster, dgHACDEdge > |
dgGraph(dgMemoryAllocator *const allocator) | dgGraph< dgHACDCluster, dgHACDEdge > |
dgHACDClusterGraph(dgMeshEffect &mesh, dgFloat32 backFaceDistanceFactor, dgReportProgress reportProgressCallback, void *const reportProgressUserData) | dgHACDClusterGraph | inline
dgList(dgMemoryAllocator *const allocator) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
Find(const dgGraphNode< dgHACDCluster, dgHACDEdge > &element) const | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
GetAllocator() const | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
GetCount() const | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
GetFirst() const | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
GetLast() const | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
GetNodeFromInfo(dgGraphNode< dgHACDCluster, dgHACDEdge > &m_info) const | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
GetNodeFromNodeData(dgHACDCluster *const nodeData) | dgGraph< dgHACDCluster, dgHACDEdge > |
HeapCollectGarbage() | dgHACDClusterGraph | inline
InsertAfter(dgListNode *const root, dgListNode *const node) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
InsertBefore(dgListNode *const root, dgListNode *const node) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
m_concavityTreeArray | dgHACDClusterGraph |
m_concavityTreeIndex | dgHACDClusterGraph |
m_convexProximation | dgHACDClusterGraph |
m_diagonal | dgHACDClusterGraph |
m_faceCount | dgHACDClusterGraph |
m_invFaceCount | dgHACDClusterGraph |
m_mark | dgHACDClusterGraph |
m_priorityHeap | dgHACDClusterGraph |
m_progress | dgHACDClusterGraph |
m_proxyList | dgHACDClusterGraph |
m_reportProgressCallback | dgHACDClusterGraph |
m_reportProgressUserData | dgHACDClusterGraph |
m_vertexMark | dgHACDClusterGraph |
m_vertexMarks | dgHACDClusterGraph |
m_vertexPool | dgHACDClusterGraph |
MarkInteriorClusterEdges(dgMeshEffect &mesh, dgInt32 mark, const dgHACDCluster &cluster, dgInt32 colorA, dgInt32 colorB) const | dgHACDClusterGraph | inline
Merge(dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > &list) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
operator dgInt32() const | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
Remove(dgListNode *const node) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
Remove(const dgGraphNode< dgHACDCluster, dgHACDEdge > &element) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
RemoveAll() | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
ReportProgress() | dgHACDClusterGraph | inline
RotateToBegin(dgListNode *const node) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
RotateToEnd(dgListNode *const node) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
SanityCheck() const | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
SetAllocator(dgMemoryAllocator *const allocator) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
SubmitEdgeCost(dgMeshEffect &mesh, dgListNode *const clusterNodeA, dgListNode *const clusterNodeB, dgFloat64 perimeterHandicap) | dgHACDClusterGraph | inline
SubmitInitialEdgeCosts(dgMeshEffect &mesh) | dgHACDClusterGraph | inline
Trace() const | dgHACDClusterGraph | inline
Unlink(dgListNode *const node) | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > |
~dgGraph() | dgGraph< dgHACDCluster, dgHACDEdge > |
~dgHACDClusterGraph() | dgHACDClusterGraph | inline
~dgList() | dgList< dgGraphNode< dgHACDCluster, dgHACDEdge > > | virtual