MeshLib Python Docs
Loading...
Searching...
No Matches
mrmeshpy.AABBTreePoints Class Reference

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
 

Static Protected Member Functions

 _pybind11_conduit_v1_ (*args, **kwargs)
 

Detailed Description

Generated from:  MR::AABBTreePoints

bounding volume hierarchy for point cloud structure

Constructor & Destructor Documentation

◆ __init__() [1/4]

None mrmeshpy.AABBTreePoints.__init__ ( self,
PointCloud pointCloud )
creates tree for given point cloud

◆ __init__() [2/4]

None mrmeshpy.AABBTreePoints.__init__ ( self,
Mesh mesh )
creates tree for vertices of given mesh

◆ __init__() [3/4]

None mrmeshpy.AABBTreePoints.__init__ ( self,
VertCoords points,
VertBitSet validPoints = None )
creates tree from given valid points

◆ __init__() [4/4]

None mrmeshpy.AABBTreePoints.__init__ ( self,
VertCoords points,
VertBitSet validPoints )
creates tree from given valid points

Member Function Documentation

◆ _pybind11_conduit_v1_()

mrmeshpy.AABBTreePoints._pybind11_conduit_v1_ ( * args,
** kwargs )
staticprotected

◆ getBoundingBox()

Box3f mrmeshpy.AABBTreePoints.getBoundingBox ( self)
returns the root node bounding box

◆ getLeafOrder()

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

◆ getLeafOrderAndReset()

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

◆ heapBytes()

int mrmeshpy.AABBTreePoints.heapBytes ( self)
returns the amount of memory this object occupies on heap

◆ nodes()

Vector_AABBTreePoints_Node_NodeId mrmeshpy.AABBTreePoints.nodes ( self)

◆ operator()

AABBTreePoints.Node mrmeshpy.AABBTreePoints.operator ( self,
NodeId nid )

◆ orderedPoints()

std_vector_AABBTreePoints_Point mrmeshpy.AABBTreePoints.orderedPoints ( self)

◆ refit()

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)

◆ rootNodeId()

NodeId mrmeshpy.AABBTreePoints.rootNodeId ( )
static

Member Data Documentation

◆ NodeVec

mrmeshpy.AABBTreePoints.NodeVec = Vector_AABBTreePoints_Node_NodeId
static

The documentation for this class was generated from the following file: