Metraipolis › archive › dc_084d61bc2b93

Reducing the Gap Between Spatial and Space-Filling Curve Neighbors in 3D Point Cloud Segmentation — arXiv:2610.19530

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.19530
License (as archived)
CC0-1.0
Archived
2026-10-15T21:56:05.155Z
SHA-256 of the archived text
b7de3252251ad6c08eed1f4ec22ebaec974ebc0ebe9fd2bd8d0b9f4485ee34d4
Stable URL of this page
https://metraipolis.com/documento/dc_084d61bc2b93

How to cite

Reducing the Gap Between Spatial and Space-Filling Curve Neighbors in 3D Point Cloud Segmentation — arXiv:2610.19530 — arXiv (en), https://arxiv.org/abs/2610.19530 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_084d61bc2b93 (Metraipolis archive dc_084d61bc2b93, sha256 b7de3252251ad6c08eed1f4ec22ebaec974ebc0ebe9fd2bd8d0b9f4485ee34d4)
BibTeX
@misc{dc084d61bc2b93,
  title = {Reducing the Gap Between Spatial and Space-Filling Curve Neighbors in 3D Point Cloud Segmentation — arXiv:2610.19530},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.19530},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_084d61bc2b93; sha256 b7de3252251ad6c08eed1f4ec22ebaec974ebc0ebe9fd2bd8d0b9f4485ee34d4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19530. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

As a lightweight and highly accurate method for nearest-neighbor search in 3D point clouds, approaches based on space-filling curves (SFC) have been proposed. However, due to the inherent properties of SFC, a gap arises between proximity relationships along the SFC and those in the original Euclidean space. In this study, we propose a loss function that reduces the influence of this gap. Specifically, we compute the distances between adjacent points along the SFC and train the model to optimize feature similarity between pairs of points that are distant from each other in the original 3D space. We incorporate the proposed method into a high-performing 3D point cloud segmentation model and evaluate its effectiveness on three datasets. The results demonstrate that the proposed method outperforms conventional methods on both indoor and outdoor point cloud datasets.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.CV, nuovi lavori del giorno).
Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV).
Pagina del lavoro: https://arxiv.org/abs/2610.19530 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T21:38:29.468Z dalla pagina https://arxiv.org/list/cs.CV/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).