struct
FPointCloudChunk
Points are ordered by a rank that is a pure function of the dedup cell they occupy, so "draw at half density" is "draw the first half" and "thin this chunk" is "drop the tail" — both stable under insertion order, which is what lets a decimated chunk survive a save/load round-trip unchanged. The chunk's points are split across pages in that order: page k holds points [k * kPageCapacity, (k + 1) * kPageCapacity), so thinning frees pages off the end and a distance LOD is a prefix of the first few.
- Module
- Game
- Header
#include "PointCloud/PointCloudAccumulator.h"- Namespace
Mowo
Properties
| Type | Name | Description |
|---|---|---|
static constexpr uint32_t | kRankBuckets | Default 16. |
static constexpr uint32_t | kRankRange | Default 256. |
static constexpr uint32_t | kNoSlot | Default 0xFFFFFFFFu. |
static constexpr uint16_t | kNoDedupEntry | Default 0xFFFFu. |
FPointCloudSector | sector | |
std::vector<PointCloudPoint> | points | |
std::vector<uint32_t> | pages | |
Vec3 | boundsMin | Default Vec3(0.0f, 0.0f, 0.0f). |
Vec3 | boundsMax | Default Vec3(0.0f, 0.0f, 0.0f). |
uint32_t rankPrefix[kRankBuckets] = | ||
uint32_t | rankCeiling | Default kRankRange. |
uint64_t | lastTouchedTick | Default 0. |
uint16_t | newestBirth | The newest birth stamp in the chunk, kept on insert and on a re-scan's re-stamp, so the 1 Hz expiry pass asks one number per chunk. Default 0. |
bool | dirty | Default true. |
bool | sorted | Default true. |
std::vector<uint16_t> | dedupSlots | Only exists between the first insert after a sort and the next sort. A chunk nobody is scanning needs no lookup table, and at a full budget the table held for every resident chunk cost half as much again as the points. |
Generated from PointCloud/PointCloudAccumulator.h via game.json · Nov 5, 2026Version 1.0.0