cartesian-sort

Here are 2 public repositories matching this topic...

ArmanddeCacqueray / SquareNet

Bijective Gridification - Cartesian sort algorithm for fast scalable point cloud to lattice mapping preserving local neighorhood, enabling tensor based processing of arbitrary datasets.

voxelizer approximate-nearest-neighbor-search point-clouds spatial-indexing tensorization bijective-gridification cartesian-sort space-filling-net lattice-mapping

Updated Aug 8, 2026
Jupyter Notebook

ArmanddeCacqueray / Cartesian-Sort

Star

mulit key sorting of point clouds, using a row/column approach instead of usual linear space filling curve, to better align with tensor based ML frameworks

nearest-neighbor-search point-clouds multi-indexing optimal-transport space-filling-curves cartesian-sort bijective-gridificatio

Updated Aug 8, 2026
Python

Improve this page

Add a description, image, and links to the cartesian-sort topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the cartesian-sort topic, visit your repo's landing page and select "manage topics."

Learn more