A New Simplification Algorithm for Scattered Point Clouds with Feature Preservation

doi:10.3390/sym13030399

A New Simplification Algorithm for Scattered Point Clouds with Feature Preservation

2021-02-28

0

OA

AI

DOI：10.3390/sym13030399

原文链接

查看原文

摘要

En 中文

High-precision and high-density three-dimensional point cloud models usually contain redundant data, which implies extra time and hardware costs in the subsequent data processing stage. To analyze and extract data more effectively, the point cloud must be simplified before data processing. Given that point cloud simplification must be sensitive to features to ensure that more valid information can be saved, in this paper, a new simplification algorithm for scattered point clouds with feature preservation, which can reduce the amount of data while retaining the features of data, is proposed. First, the Delaunay neighborhood of the point cloud is constructed, and then the edge points of the point cloud are extracted by the edge distribution characteristics of the point cloud. Second, the moving least-square method is used to obtain the normal vector of the point cloud and the valley ridge points of the model. Then, potential feature points are identified further and retained on the basis of the discrete gradient idea. Finally, non-feature points are extracted. Experimental results show that our method can be applied to models with different curvatures and effectively avoid the hole phenomenon in the simplification process. To further improve the robustness and anti-noise ability of the method, the neighborhood of the point cloud can be extended to multiple levels, and a balance between simplification speed and accuracy needs to be found.

A New Simplification Algorithm for Scattered Point Clouds with Feature Preservation

摘要

AI总结

期刊

机构

引用论文