Abstract

This paper proposes a simplification algorithm based on four feature parameters, aiming at solving the problem that the edge features cannot be retained due to the incompletely extracted sharp features during point cloud simplification. Firstly, K neighborhood searching is carried out for point cloud, and K neighborhood points are quickly found by a dynamic grid method. Then, four features including: the curvature of the point, the average of the normal angle of a point from a neighborhood point, the average distance between the point and the neighborhood point and the distance between the point and the center of gravity of the neighborhood point, are calculated according to the K neighborhood of the data point. The four parameters are used to define the feature discrimination parameters and feature thresholds, to compare the size and extract the feature points; finally, the non-feature points are reduced twice by the method of the bounding box, and the reduced point cloud and feature points are spliced to achieve the purpose of simplification. The experimental results show that the distance between the point and the center of gravity of the neighborhood has a great influence on the simplified model boundary, which effectively guarantees the accuracy of the simplified model.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.