MeshLib C# Docs
Loading...
Searching...
No Matches

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...

Inheritance diagram for MR.Const_AABBTree:

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

Detailed Description

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.

Constructor & Destructor Documentation

◆ Const_AABBTree() [1/4]

unsafe MR.Const_AABBTree.Const_AABBTree ( )
inline

Constructs an empty (default-constructed) instance.

◆ Const_AABBTree() [2/4]

unsafe MR.Const_AABBTree.Const_AABBTree ( MR._ByValue_AABBTree _other)
inline

Generated from constructor MR.AABBTree.AABBTree.

◆ Const_AABBTree() [3/4]

unsafe MR.Const_AABBTree.Const_AABBTree ( MR.Const_MeshPart mp)
inline

creates tree for given mesh or its part Generated from constructor MR.AABBTree.AABBTree.

◆ Const_AABBTree() [4/4]

unsafe MR.Const_AABBTree.Const_AABBTree ( MR.Const_TriMesh tmesh,
MR.Const_FaceBitSet? region = null )
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.

Member Function Documentation

◆ Dispose() [1/2]

virtual void MR.Const_AABBTree.Dispose ( )
inlinevirtual

◆ Dispose() [2/2]

virtual unsafe void MR.Const_AABBTree.Dispose ( bool disposing)
inlineprotectedvirtual

◆ getBoundingBox()

unsafe MR.Box3f MR.Const_AABBTree.getBoundingBox ( )
inline

returns the bounding box of the whole tree (empty for an empty tree) Generated from method MR.AABBTree.getBoundingBox.

◆ getLeafOrder()

unsafe void MR.Const_AABBTree.getLeafOrder ( MR.FaceBMap faceMap)
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.

◆ getNodesFromFaces()

unsafe MR.NodeBitSet MR.Const_AABBTree.getNodesFromFaces ( MR.Const_FaceBitSet faces)
inline

returns the nodes having at least one of given triangles in their subtrees Generated from method MR.AABBTree.getNodesFromFaces.

◆ getSubtreeFaces()

unsafe MR.FaceBitSet MR.Const_AABBTree.getSubtreeFaces ( MR.NodeId subtreeRoot)
inline

returns all triangles in the subtree with given root Generated from method MR.AABBTree.getSubtreeFaces.

◆ getSubtrees()

unsafe MR.Std.Vector_MRNodeId MR.Const_AABBTree.getSubtrees ( int minNum)
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.

◆ heapBytes()

unsafe nuint MR.Const_AABBTree.heapBytes ( )
inline

returns the amount of memory this object occupies on heap Generated from method MR.AABBTree.heapBytes.

◆ leafBoxes()

unsafe MR.Const_Vector_MRBox3f MR.Const_AABBTree.leafBoxes ( )
inline

the bounding boxes of the triangles in the order of leafTris(), slightly expanded for robust searches Generated from method MR.AABBTree.leafBoxes.

◆ leafTris()

unsafe MR.Const_Vector_MRAABBTreeWideLeafTri MR.Const_AABBTree.leafTris ( )
inline

triangles of all leaves, the triangles of each leaf are contiguous Generated from method MR.AABBTree.leafTris.

◆ nodes()

unsafe MR.Const_Vector_MRAABBTreeWideNode_MRNodeId MR.Const_AABBTree.nodes ( )
inline

the root is the first node, if any Generated from method MR.AABBTree.nodes.

Member Data Documentation

◆ __ref_storage_MaxChildren

unsafe int* MR.Const_AABBTree.__ref_storage_MaxChildren
staticprotected

◆ __ref_storage_MaxDepth

unsafe int* MR.Const_AABBTree.__ref_storage_MaxDepth
staticprotected

◆ __ref_storage_MaxLeafTris

unsafe int* MR.Const_AABBTree.__ref_storage_MaxLeafTris
staticprotected

Property Documentation

◆ MaxChildren

unsafe int MR.Const_AABBTree.MaxChildren
staticget

◆ MaxDepth

unsafe int MR.Const_AABBTree.MaxDepth
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

◆ MaxLeafTris

unsafe int MR.Const_AABBTree.MaxLeafTris
staticget

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