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

Konan Sasaki, Junya Komori, Kazuhiro Hotta
10/14/2026
cs.CV

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{sasaki2026reducing,
  title  = {Reducing the Gap Between Spatial and Space-Filling Curve Neighbors in 3D Point Cloud Segmentation},
  author = {Konan Sasaki and Junya Komori and Kazuhiro Hotta},
  year   = {2026},
  eprint = {2610.19530},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2610.19530v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2610.19530.svg)](https://codeofpaper.com/paper/2610.19530)

Discussion