Metraipolis › archive › dc_6ddf5144d83e

Unsigned Distance Maps on 2D Point Cloud Registration — arXiv:2609.25932

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25932
License (as archived)
CC0-1.0
Archived
2026-10-08T16:43:43.990Z
SHA-256 of the archived text
0213e51af59d89987f2edbceef65ac2386110b66f18f6826bae49d045f41d768
Stable URL of this page
https://metraipolis.com/documento/dc_6ddf5144d83e

How to cite

Unsigned Distance Maps on 2D Point Cloud Registration — arXiv:2609.25932 — arXiv (en), https://arxiv.org/abs/2609.25932 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6ddf5144d83e (Metraipolis archive dc_6ddf5144d83e, sha256 0213e51af59d89987f2edbceef65ac2386110b66f18f6826bae49d045f41d768)
BibTeX
@misc{dc6ddf5144d83e,
  title = {Unsigned Distance Maps on 2D Point Cloud Registration — arXiv:2609.25932},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25932},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6ddf5144d83e; sha256 0213e51af59d89987f2edbceef65ac2386110b66f18f6826bae49d045f41d768},
  year = {2026}
}

Archived text

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

2D point cloud registration arises in laser odometry and Simultaneous Localization and Mapping (SLAM) for mobile robots. Iterative Closest Point (ICP) is one of the most widely used approaches. Still, its iterative procedure recomputes correspondences via nearest-neighbor search at every iteration, whereas correspondence-free alternatives focus on scan-to-map alignment. This paper proposes a 2D point cloud registration approach based on unsigned distance maps, precomputing the Euclidean distance to the nearest reference point, along with its spatial derivatives, over a discrete grid, replacing the per-iteration search with O(1) lookups. Moreover, point-to-point and point-to-plane error formulations are derived on the SE(2) manifold and solved via Gauss-Newton optimization. On a synthetic benchmark and the real-world IILABS 3D dataset, the precomputed point-to-point variant outperforms its analytical counterparts, achieving competitive laser-odometry drift compared to point-to-plane formulations, as the precomputed gradient regularizes correspondences in the presence of sensor noise.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-23 in cs.RO).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2609.25932 — 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-08T15:56:53.474Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).