CCCoreLib 31 May 2022
CloudCompare Core algorithms
Public Attributes | List of all members
CCCoreLib::KDTree::KdCell Struct Reference

A KDTre cell struct. More...

#include <KdTree.h>

Collaboration diagram for CCCoreLib::KDTree::KdCell:
Collaboration graph
[legend]

Public Attributes

CCVector3 inbbmax
 Inside bounding box max point. More...
 
CCVector3 inbbmin
 Inside bounding box min point. More...
 
CCVector3 outbbmin
 Outside bounding box min point. More...
 
CCVector3 outbbmax
 Outside bounding box max point. More...
 
unsigned cuttingDim
 Dimension (0, 1 or 2 for x, y or z) which is used to separate the two children.
 
PointCoordinateType cuttingCoordinate
 Place where the space is cut into two sub-spaces (children)
 
struct KdCellleSon
 Each point p which lie in leSon is such as p[cuttingDim] <= cuttingCoordinate.
 
struct KdCellgSon
 Each point p which lie in gSon is such as p[cuttingDim] > cuttingCoordinate.
 
struct KdCellfather
 To go up in the tree.
 
unsigned startingPointIndex
 Index of the first element that belongs to this cell.
 
unsigned nbPoints
 Number of elements in this cell.
 
unsigned char boundsMask
 Mask to know if the outside box is bounded for a given dimmension. More...
 

Detailed Description

A KDTre cell struct.

Member Data Documentation

◆ boundsMask

unsigned char CCCoreLib::KDTree::KdCell::boundsMask

Mask to know if the outside box is bounded for a given dimmension.

if boundsMask & (2^d) then outbbmin.u[d] is bounded (else the box is opened in outmin.u[d] - i.e. outbbmin.u[d] = -infinite) if boundsmask & (2^(3+d)) then outbbmax.u[d] is bounded (else the box is opened in outmax.u[d] - i.e. outbbmax.u[d] = infinite)

◆ inbbmax

CCVector3 CCCoreLib::KDTree::KdCell::inbbmax

Inside bounding box max point.

The inside bounding box is the smallest cube containing all the points in the cell

◆ inbbmin

CCVector3 CCCoreLib::KDTree::KdCell::inbbmin

Inside bounding box min point.

The inside bounding box is the smallest cube containing all the points in the cell

◆ outbbmax

CCVector3 CCCoreLib::KDTree::KdCell::outbbmax

Outside bounding box max point.

The outside bounding box is the bigest cube contained inside the cutting planes that lead to the cell

◆ outbbmin

CCVector3 CCCoreLib::KDTree::KdCell::outbbmin

Outside bounding box min point.

The outside bounding box is the bigest cube contained inside the cutting planes that lead to the cell


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