Classes | |
class | Node |
class | NodeBitSet |
class | Point |
Public Member Functions | |
None | __init__ (self, PointCloud pointCloud) |
None | __init__ (self, Mesh mesh) |
None | __init__ (self, VertCoords points, VertBitSet validPoints=None) |
None | __init__ (self, VertCoords points, VertBitSet validPoints) |
Box3f | getBoundingBox (self) |
None | getLeafOrder (self, VertBMap vertMap) |
None | getLeafOrderAndReset (self, VertBMap vertMap) |
int | heapBytes (self) |
Vector_AABBTreePoints_Node_NodeId | nodes (self) |
AABBTreePoints.Node | operator (self, NodeId nid) |
std_vector_AABBTreePoints_Point | orderedPoints (self) |
None | refit (self, VertCoords newCoords, VertBitSet changedVerts) |
Static Public Member Functions | |
NodeId | rootNodeId () |
Static Public Attributes | |
NodeVec = Vector_AABBTreePoints_Node_NodeId | |
Generated from: MR::AABBTreePoints bounding volume hierarchy for point cloud structure
None meshlib.mrmeshpy.AABBTreePoints.__init__ | ( | self, | |
PointCloud | pointCloud ) |
creates tree for given point cloud
None meshlib.mrmeshpy.AABBTreePoints.__init__ | ( | self, | |
Mesh | mesh ) |
creates tree for vertices of given mesh
None meshlib.mrmeshpy.AABBTreePoints.__init__ | ( | self, | |
VertCoords | points, | ||
VertBitSet | validPoints = None ) |
creates tree from given valid points
None meshlib.mrmeshpy.AABBTreePoints.__init__ | ( | self, | |
VertCoords | points, | ||
VertBitSet | validPoints ) |
creates tree from given valid points
Box3f meshlib.mrmeshpy.AABBTreePoints.getBoundingBox | ( | self | ) |
returns the root node bounding box
None meshlib.mrmeshpy.AABBTreePoints.getLeafOrder | ( | self, | |
VertBMap | vertMap ) |
returns the mapping original VertId to new id following the points order in the tree; buffer in vertMap must be resized before the call, and caller is responsible for filling missing vertex elements
None meshlib.mrmeshpy.AABBTreePoints.getLeafOrderAndReset | ( | self, | |
VertBMap | vertMap ) |
returns the mapping original VertId to new id following the points order in the tree; then resets leaf order as if the points were renumberd following the mapping; buffer in vertMap must be resized before the call, and caller is responsible for filling missing vertex elements
int meshlib.mrmeshpy.AABBTreePoints.heapBytes | ( | self | ) |
returns the amount of memory this object occupies on heap
Vector_AABBTreePoints_Node_NodeId meshlib.mrmeshpy.AABBTreePoints.nodes | ( | self | ) |
AABBTreePoints.Node meshlib.mrmeshpy.AABBTreePoints.operator | ( | self, | |
NodeId | nid ) |
std_vector_AABBTreePoints_Point meshlib.mrmeshpy.AABBTreePoints.orderedPoints | ( | self | ) |
None meshlib.mrmeshpy.AABBTreePoints.refit | ( | self, | |
VertCoords | newCoords, | ||
VertBitSet | changedVerts ) |
updates bounding boxes of the nodes containing changed vertices; this is a faster alternative to full tree rebuild (but the tree after refit might be less efficient) \\param newCoords coordinates of all vertices including changed ones; \\param changedVerts vertex ids with modified coordinates (since tree construction or last refit)
|
static |
|
static |