Public Member Functions | |
| ConstAABBTreeNode_AABBTreeTraits_UndirectedEdgeTag_Box2f | __getitem__ (self, ConstNodeId nid) |
| __init__ (self, *args, **kwargs) | |
| ConstBox2f | box (self, ConstNodeId n) |
| bool | empty (self) |
| Box2f | getBoundingBox (self) |
| None | getLeafOrder (self, UndirectedEdgeBMap leafMap) |
| NodeBitSet | getNodesFromLeaves (self, ConstUndirectedEdgeBitSet leaves) |
| UndirectedEdgeBitSet | getSubtreeLeaves (self, ConstNodeId subtreeRoot) |
| std_vector_Id_NodeTag | getSubtrees (self, int minNum) |
| int | heapBytes (self) |
| ConstBoxedLeaf_AABBTreeTraits_UndirectedEdgeTag_Box2f | leaf (self, ConstNodeId n) |
| UndirectedEdgeId | leafId (self, ConstNodeId n) |
| ConstVector_BoxedLeaf_AABBTreeTraits_UndirectedEdgeTag_Box2f | leaves (self) |
| ConstVector_AABBTreeNode_AABBTreeTraits_UndirectedEdgeTag_Box2f_NodeId | nodes (self) |
| int | numLeaves (self) |
| NodeId | rootNodeId (self) |
Static Public Member Functions | |
| bool | isLeaf (ConstNodeId n) |
Generated from: MR::AABBTreeBase<MR::AABBTreeTraits<MR::UndirectedEdgeTag, MR::Box2f>> Aliases: AABBTreePolyline_Vector2f_Base base class for the AABB-trees of polylines and objects
| mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.__init__ | ( | self, | |
| * | args, | ||
| ** | kwargs ) |
__init__(*args, **kwargs) Overloaded function. 1. __init__(self: meshlib.mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f) -> None 2. __init__(self: meshlib.mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f, arg0: meshlib.mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f) -> None Implicit copy constructor. 3. __init__(self: meshlib.mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f, : meshlib.mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f) -> None
| ConstAABBTreeNode_AABBTreeTraits_UndirectedEdgeTag_Box2f mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.__getitem__ | ( | self, | |
| ConstNodeId | nid ) |
const-access to any not-leaf node
| ConstBox2f mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.box | ( | self, | |
| ConstNodeId | n ) |
returns the bounding box of given node or leaf
| bool mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.empty | ( | self | ) |
returns true if the tree has no leaves
| Box2f mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.getBoundingBox | ( | self | ) |
returns the root node bounding box
| None mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.getLeafOrder | ( | self, | |
| UndirectedEdgeBMap | leafMap ) |
fills map: LeafId -> leaf#; buffer in leafMap must be resized before the call, and caller is responsible for filling missing leaf elements
| NodeBitSet mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.getNodesFromLeaves | ( | self, | |
| ConstUndirectedEdgeBitSet | leaves ) |
returns set of not-leaf nodes containing among direct or indirect children given leaves
| UndirectedEdgeBitSet mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.getSubtreeLeaves | ( | self, | |
| ConstNodeId | subtreeRoot ) |
returns all leaves in the subtree with given root (can be a leaf)
| std_vector_Id_NodeTag mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.getSubtrees | ( | self, | |
| int | minNum ) |
returns at least given number of top-level not-intersecting subtrees (some can be leaves), union of which contain all tree leaves
| int mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.heapBytes | ( | self | ) |
returns the amount of memory this object occupies on heap
|
static |
returns true if given node id is in fact a leaf (encoded as negative number)
| ConstBoxedLeaf_AABBTreeTraits_UndirectedEdgeTag_Box2f mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.leaf | ( | self, | |
| ConstNodeId | n ) |
returns the leaf encoded in given node id
| UndirectedEdgeId mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.leafId | ( | self, | |
| ConstNodeId | n ) |
returns the id of the leaf encoded in given node id
| ConstVector_BoxedLeaf_AABBTreeTraits_UndirectedEdgeTag_Box2f mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.leaves | ( | self | ) |
all leaves in the order of the tree right after its construction
| ConstVector_AABBTreeNode_AABBTreeTraits_UndirectedEdgeTag_Box2f_NodeId mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.nodes | ( | self | ) |
const-access to all not-leaf nodes, a tree with N leaves has N-1 nodes
| int mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.numLeaves | ( | self | ) |
returns the number of leaves in whole tree
| NodeId mrmeshpy.ConstAABBTreeBase_AABBTreeTraits_UndirectedEdgeTag_Box2f.rootNodeId | ( | self | ) |
returns root node id: 0 if the tree has at least two leaves, or the only leaf; must not be called for empty tree
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |
|
static |