ISpaceFillingCurve
Interfaces · AiDotNet.ComputerVision.Segmentation.PointCloud
A space-filling curve that maps a 3D integer grid coordinate to a position on a 1D curve.
For Beginners
Imagine drawing one continuous line that visits every cell of a 3D grid. The position along that line is the cell’s “code”. Sorting points by code lines them up so that neighbours in the list are usually neighbours in space.
How It Works
Point Transformer V3 (Wu et al., CVPR 2024, Sec. 3.1) replaces neighbourhood search with serialization: every voxelised point gets a curve code, the points are sorted by that code, and attention runs over contiguous patches of the sorted sequence. Points that are close on a space-filling curve are close in space, so a patch of the sorted list is a spatial neighbourhood.
The paper uses four orders (ZOrder, Hilbert
and their x/y-transposed variants ZOrderTransposed and
HilbertTransposed) and cycles
through them block by block. Implement this interface to add another curve; register it with
Register so a saved or cloned model can rebuild it by
Name.
Properties
| Property | Summary |
|---|---|
string Name { get; } |
A stable identifier for this curve, used to rebuild it when a model is saved, loaded or cloned. |
Methods
| Method | Summary |
|---|---|
long Encode(int x, int y, int z, int depth) |
Encodes one grid coordinate. |