|
ReUseX
0.0.5
3D Point Cloud Processing for Building Reuse
|
Header of a serialized tile index blob (version 2). More...
#include <tile_index.hpp>
Public Attributes | |
| uint32_t | magic |
| uint32_t | version |
| 2. | |
| uint32_t | tile_bits |
| log2(K), so K = 2^tile_bits tiles. | |
| uint32_t | point_count |
| float | lo [3] |
| Cloud bbox minimum (world coords). | |
| float | hi [3] |
| Cloud bbox maximum (world coords). | |
Header of a serialized tile index blob (version 2).
Tile assignment uses the BOTTOM tile_bits bits of the 30-bit bit-reversed Morton sort key, which equal the TOP tile_bits bits of the plain Morton code. These bits identify the coarsest spatial octant, so each tile covers one spatial cell of a (2^(tile_bits/3))³ grid over the cloud's bbox. The cloud bbox (lo, hi) stored here is required to recompute sort keys at serve time without re-reading all point data.
Definition at line 38 of file tile_index.hpp.
| float reusex::pipeline::TileIndexHeader::hi[3] |
Cloud bbox maximum (world coords).
Definition at line 44 of file tile_index.hpp.
| float reusex::pipeline::TileIndexHeader::lo[3] |
Cloud bbox minimum (world coords).
Definition at line 43 of file tile_index.hpp.
| uint32_t reusex::pipeline::TileIndexHeader::magic |
Definition at line 39 of file tile_index.hpp.
| uint32_t reusex::pipeline::TileIndexHeader::point_count |
Definition at line 42 of file tile_index.hpp.
| uint32_t reusex::pipeline::TileIndexHeader::tile_bits |
log2(K), so K = 2^tile_bits tiles.
Definition at line 41 of file tile_index.hpp.
| uint32_t reusex::pipeline::TileIndexHeader::version |
2.
Definition at line 40 of file tile_index.hpp.