Font Size: a A A

Research On Hole Repairing Algorithm Of 3D Point Cloud And Development For The Software System

Posted on:2021-05-02Degree:MasterType:Thesis
Country:ChinaCandidate:Z L ChengFull Text:PDF
GTID:2428330626958555Subject:Digital mine and subsidence control engineering
Abstract/Summary:PDF Full Text Request
When using a 3D laser scanner or other equipment to collect the surface information of the object to be measured,the original point cloud obtained loses some data due to object occlusion or measurement methods,which leads to the formation of holes and further affects the quality of the reconstructed digital model.When using 3D laser scanner supporting software or programming means to repair holes,there is a problem of poor scalability and migration,and the accuracy needs to be improved.Based on the research and analysis of hole repair related algorithms and the current status of hole repair related software development,this thesis designs and develops a 3D point cloud hole repair software system.The main work and achievements are as follows:(1)A globally applicable data structure is designed for data organization.For the existing point cloud k-neighbor search algorithm,boundary extraction algorithm and hole repair algorithm with different data structures and complex programming problems,this thesis chooses a suitable algorithm combination,this thesis selects a suitable algorithm combination,defines the coordinate and point as base classes of the point cloud data,and uses the k nearest neighbor class defined by these two base classes as the basic unit to serve the data processing at different stages of hole repair,which simplifies the difficulty of programming,improves the efficiency of combining multiple algorithms and reduces memory overhead.(2)In view of the shortcomings of the boundary extraction algorithm based on the feature plane,this thesis simplifies the solution of the equation coefficients by optimizing the general equations of the least squares fitting plane,which makes the process of programming solving easy and improves the efficiency of the algorithm.This thesis uses a combination of multiple hole repair algorithms to fill holes.After the hole is repaired,an implicit surface based on the radial basis function is used to adjust the repair area to improve the repair effect.Aiming at the local expansion algorithm based on the scattered point cloud model,the new point formulas of the different angles between adjacent edges are discussed and deduced to verify the generality of the algorithm.Aiming at the spatial polygon hole repair algorithm based on the triangular mesh model,through the classification and discussion of polygons,the value range of the minimum included angle between two adjacent sides is determined,the redundant processing steps of the original algorithm are deleted.Through geometric analysis and reconstruction,the complicated formula derivation is simplified,the calculation model of the new points is optimized,the algorithm processing process is improved,and the algorithm efficiency is improved.(3)A software system that combines a single page web application with a console program is designed.The system consists of two parts: front-end and back-end.The front-end adopts a single-page web application development mode.WebGL is used for model drawing and three-dimensional rendering.The front-end implements the functions of data import and output,model display,operation and user interaction.The background uses a console program based on the idea of object-oriented programming,and uses MVVM as a software architecture to guide the development,and realize the functions of data input and output and data processing.This system is not only applicable to a wide range of scenarios,but has a good user experience,and it is easy to migrate to other terminals,and is simple to maintain in the future,with low cost for function modification and expansion.There are 82 diagrams,4 charts and 120 reference articles in this thesis.
Keywords/Search Tags:hole repair, software development, boundary extraction, k nearest neighbor searching, triangular mesh
PDF Full Text Request
Related items