Classes | |
| class | Node |
| class | NodeBitSet |
| class | Point |
Public Member Functions | |
| AABBTreePoints.Node | __getitem__ (self, NodeId nid) |
| 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) |
| 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 mrmeshpy.AABBTreePoints.__init__ | ( | self, | |
| PointCloud | pointCloud ) |
creates tree for given point cloud
| None mrmeshpy.AABBTreePoints.__init__ | ( | self, | |
| Mesh | mesh ) |
creates tree for vertices of given mesh
| None mrmeshpy.AABBTreePoints.__init__ | ( | self, | |
| VertCoords | points, | ||
| VertBitSet | validPoints = None ) |
creates tree from given valid points
| None mrmeshpy.AABBTreePoints.__init__ | ( | self, | |
| VertCoords | points, | ||
| VertBitSet | validPoints ) |
creates tree from given valid points
| AABBTreePoints.Node mrmeshpy.AABBTreePoints.__getitem__ | ( | self, | |
| NodeId | nid ) |
| Box3f mrmeshpy.AABBTreePoints.getBoundingBox | ( | self | ) |
returns the root node bounding box
| None 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 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 mrmeshpy.AABBTreePoints.heapBytes | ( | self | ) |
returns the amount of memory this object occupies on heap
| Vector_AABBTreePoints_Node_NodeId mrmeshpy.AABBTreePoints.nodes | ( | self | ) |
| std_vector_AABBTreePoints_Point mrmeshpy.AABBTreePoints.orderedPoints | ( | self | ) |
| None 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 |