Fast three-dimensional point cloud registration algorithm based on plane and curvature parameters

The rapid generation of three-dimensional (3D) imaging has improved the safety and operational efficiency of advanced driver assistance systems and mobile robotics technologies. To expedite the stitching process for 3D point cloud data, this study proposes and validates a method that combines coarse registration based on planarity and fine registration based on curvature features. Multiple 3D scenes were collected in the experiments, and the runtime performance was systematically analyzed. Compared with the ICP algorithm, the improved algorithm achieves faster registration speed, with improvements of 19.7% in the cabinet scene, 86.6% in the pig zodiac doll scene, and 61.9% in the tellurion scene. Moreover, the increased efficiency is achieved with negligible impact on the matching residuals. Processing point cloud data without planar information posed challenges in terms of efficiency; however, a notable improvement in processing speed was observed, with point cloud data containing planar scenes. It is important for applications related to 3D imaging registration.

Authors

Institutions

Publication Details

Journal
AIP Advances
Published
2026-02-01
DOI
https://doi.org/10.1063/5.0314379
Primary Topic
Robotics and Sensor-Based Localization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fast three-dimensional point cloud registration algorithm based on plane and curvature parameters

Shenyuan Ye, Jiabin Liu, Zhengguang Duan, Wangyang Lou
AIP Advances
Robotics and Sensor-Based Localization
article

Fast three-dimensional point cloud registration algorithm based on plane and curvature parameters

Shenyuan Ye, Jiabin Liu, Zhengguang Duan, Wangyang Lou
article en

Abstract

The rapid generation of three-dimensional (3D) imaging has improved the safety and operational efficiency of advanced driver assistance systems and mobile robotics technologies. To expedite the stitching process for 3D point cloud data, this study proposes and validates a method that combines coarse registration based on planarity and fine registration based on curvature features. Multiple 3D scenes were collected in the experiments, and the runtime performance was systematically analyzed. Compared with the ICP algorithm, the improved algorithm achieves faster registration speed, with improvements of 19.7% in the cabinet scene, 86.6% in the pig zodiac doll scene, and 61.9% in the tellurion scene. Moreover, the increased efficiency is achieved with negligible impact on the matching residuals. Processing point cloud data without planar information posed challenges in terms of efficiency; however, a notable improvement in processing speed was observed, with point cloud data containing planar scenes. It is important for applications related to 3D imaging registration.

AIP AdvancesVol. 16(2)
Nanjing University of Information Science and Technology (CN), Yanshan University (CN), Zhejiang Environmental Monitoring Center (CN)
Openalex Percentile: Top 65%
Robotics and Sensor-Based Localization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Fast three-dimensional point cloud registration algorithm based on plane and curvature parameters — Shenyuan Ye, Jiabin Liu, et al. · AIP Advances (2026) | TGRS Research Map | TGRS