bounding volume hierarchy of mesh triangles with up to 4 children per node and up to 4 triangles per leaf; the children of a node are stored contiguously, and every leaf keeps the vertices and the boxes of its triangles Generated from class MR.AABBTree. This is the const half of the class. More...
Classes | |
| struct | _Underlying |
Public Member Functions | |
| virtual void | Dispose () |
| unsafe | Const_AABBTree () |
| Constructs an empty (default-constructed) instance. | |
| unsafe | Const_AABBTree (MR._ByValue_AABBTree _other) |
| Generated from constructor MR.AABBTree.AABBTree. | |
| unsafe | Const_AABBTree (MR.Const_MeshPart mp) |
| creates tree for given mesh or its part Generated from constructor MR.AABBTree.AABBTree. | |
| unsafe | Const_AABBTree (MR.Const_TriMesh tmesh, MR.Const_FaceBitSet? region=null) |
| creates tree for the triangles of tmesh (all if region is nullptr), faster than from a mesh; it is the tree of a mesh with tmesh.points and mesh.topology.getTriVerts( f ) == tmesh.tris[f] for all its triangles Generated from constructor MR.AABBTree.AABBTree. | |
| unsafe MR.Const_Vector_MRAABBTreeWideNode_MRNodeId | nodes () |
| the root is the first node, if any Generated from method MR.AABBTree.nodes. | |
| unsafe MR.Box3f | getBoundingBox () |
| returns the bounding box of the whole tree (empty for an empty tree) Generated from method MR.AABBTree.getBoundingBox. | |
| unsafe MR.Const_Vector_MRAABBTreeWideLeafTri | leafTris () |
| triangles of all leaves, the triangles of each leaf are contiguous Generated from method MR.AABBTree.leafTris. | |
| unsafe MR.Const_Vector_MRBox3f | leafBoxes () |
| the bounding boxes of the triangles in the order of leafTris(), slightly expanded for robust searches Generated from method MR.AABBTree.leafBoxes. | |
| unsafe nuint | heapBytes () |
| returns the amount of memory this object occupies on heap Generated from method MR.AABBTree.heapBytes. | |
| unsafe MR.Std.Vector_MRNodeId | getSubtrees (int minNum) |
| returns at least given number of top-level not-intersecting subtrees, union of which contain all tree leaves Generated from method MR.AABBTree.getSubtrees. | |
| unsafe MR.FaceBitSet | getSubtreeFaces (MR.NodeId subtreeRoot) |
| returns all triangles in the subtree with given root Generated from method MR.AABBTree.getSubtreeFaces. | |
| unsafe MR.NodeBitSet | getNodesFromFaces (MR.Const_FaceBitSet faces) |
| returns the nodes having at least one of given triangles in their subtrees Generated from method MR.AABBTree.getNodesFromFaces. | |
| unsafe void | getLeafOrder (MR.FaceBMap faceMap) |
| fills map: FaceId -> its position in leafTris(); buffer in faceMap must be resized before the call, and caller is responsible for filling missing face elements Generated from method MR.AABBTree.getLeafOrder. | |
Protected Member Functions | |
| virtual unsafe void | Dispose (bool disposing) |
Static Protected Attributes | |
| static unsafe int * | __ref_storage_MaxChildren |
| static unsafe int * | __ref_storage_MaxLeafTris |
| static unsafe int * | __ref_storage_MaxDepth |
Properties | |
| static unsafe int | MaxChildren [get] |
| static unsafe int | MaxLeafTris [get] |
| static unsafe int | MaxDepth [get] |
| the deepest level of a node (the root is at 0): the stacks of the traversals are sized for it, and addSplitFaces rebuilds a deeper tree | |
bounding volume hierarchy of mesh triangles with up to 4 children per node and up to 4 triangles per leaf; the children of a node are stored contiguously, and every leaf keeps the vertices and the boxes of its triangles Generated from class MR.AABBTree. This is the const half of the class.
|
inline |
Constructs an empty (default-constructed) instance.
|
inline |
Generated from constructor MR.AABBTree.AABBTree.
|
inline |
creates tree for given mesh or its part Generated from constructor MR.AABBTree.AABBTree.
|
inline |
creates tree for the triangles of tmesh (all if region is nullptr), faster than from a mesh; it is the tree of a mesh with tmesh.points and mesh.topology.getTriVerts( f ) == tmesh.tris[f] for all its triangles Generated from constructor MR.AABBTree.AABBTree.
|
inlinevirtual |
|
inlineprotectedvirtual |
|
inline |
returns the bounding box of the whole tree (empty for an empty tree) Generated from method MR.AABBTree.getBoundingBox.
|
inline |
fills map: FaceId -> its position in leafTris(); buffer in faceMap must be resized before the call, and caller is responsible for filling missing face elements Generated from method MR.AABBTree.getLeafOrder.
|
inline |
returns the nodes having at least one of given triangles in their subtrees Generated from method MR.AABBTree.getNodesFromFaces.
|
inline |
returns all triangles in the subtree with given root Generated from method MR.AABBTree.getSubtreeFaces.
|
inline |
returns at least given number of top-level not-intersecting subtrees, union of which contain all tree leaves Generated from method MR.AABBTree.getSubtrees.
|
inline |
returns the amount of memory this object occupies on heap Generated from method MR.AABBTree.heapBytes.
|
inline |
the bounding boxes of the triangles in the order of leafTris(), slightly expanded for robust searches Generated from method MR.AABBTree.leafBoxes.
|
inline |
triangles of all leaves, the triangles of each leaf are contiguous Generated from method MR.AABBTree.leafTris.
|
inline |
the root is the first node, if any Generated from method MR.AABBTree.nodes.
|
staticprotected |
|
staticprotected |
|
staticprotected |
|
staticget |
|
staticget |
the deepest level of a node (the root is at 0): the stacks of the traversals are sized for it, and addSplitFaces rebuilds a deeper tree
|
staticget |