ParticleManagement::detail::KDLeaf Struct Reference

One leaf of a kd tree: a contiguous index range into the (in-place reordered) particle buffer, plus its axis-aligned bounding box. More...

#include <CD_KDParticleMerge.H>

Public Attributes
std::size_t	lo
	Start of this leaf's member range (inclusive) in the reordered particle buffer.
std::size_t	hi
	End of this leaf's member range (exclusive) in the reordered particle buffer.
RealVect	boxLo
	Low corner of this leaf's axis-aligned bounding box.
RealVect	boxHi
	High corner of this leaf's axis-aligned bounding box.

Detailed Description

One leaf of a kd tree: a contiguous index range into the (in-place reordered) particle buffer, plus its axis-aligned bounding box.

Leaves are never grid-aligned by construction (see buildKDQuotaLeaves()) – a leaf's box can legitimately straddle a cell face. Whether a leaf is interior, a boundary candidate, or unmergeable is NOT stored here; it is derived at classification time from the leaf's own members/box (see mergeKDCarve()'s implementation) so there is exactly one source of truth for that decision.

---

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

• Source/Particle/CD_KDParticleMerge.H