Abstract
Visualization is one of the most intuitive and perceptible ways for information representation in the big data era. As an essential part of the visualization, 3D mesh reconstruction is facing great challenges due to its characteristics of quantity, non-structure, and low-accuracy. The traditional 3D mesh reconstruction method has strict theoretical proof and can be used to reconstruct the surface of the complex topological structure for computer rendering and display. However, it is not suitable to handle a large number of point cloud and noise point cloud in a big data platform because the process is inefficient, low-automation and requires massive calculations. To address this issue, we propose a region growing based 3D mesh reconstruction (R3MR) in the big data platform. Firstly, we divide the large data points into three categories: flat point set, high curvature point set, and boundary point set. The errors of topological structure for 3D meshes usually occur in the place with large curvatures and noise points, so the division of high curvature point set is beneficial to solve the low-accuracy problem in 3D mesh reconstruction. Moreover, the flat points can be treated as one kind of point to avoid repetitive calculations because their features are basically the same. Hence, the division of the flat point set is beneficial to solve the problem of quantity and massive calculations. Secondly, our proposal is to start the mesh reconstruction from the flat point set progressively, because it can obtain the outline of the 3D model. In many scenarios, such as autonomous driving, only the overall outline of the model is required. Finally, during the 3D mesh reconstruction, the inner edge adjacency list and optimal selection principle are set to improve the robustness of the whole system. Simulation experiments show that the proposed 3D mesh reconstruction can naturally reflect the detailed features of objects in the big data platform, especially effective for the scattered point cloud.
Highlights
In the high-tech era, big data comes into being
CONSTRUCTION OF TRIANGULAR MESH Region growing based 3D mesh reconstruction in big data platform starts with ‘‘seed’’ triangle when constructing the mesh, in the order from the smooth point set to the high curvature point set and the boundary point set
3) THE PRINCIPLE OF SELECTING THE OPTIMAL POINT In the triangular mesh reconstruction based on region growing, if the optimal point can be reasonably selected, it will have an important impact on the subsequent accurate display of the topological relationship of point cloud data and the improvement of the efficiency of the method
Summary
In the high-tech era, big data comes into being. Just like mining coal, we use reasonable mining costs to mine valuable data in big data. C. CONSTRUCTION OF TRIANGULAR MESH Region growing based 3D mesh reconstruction in big data platform starts with ‘‘seed’’ triangle when constructing the mesh, in the order from the smooth point set to the high curvature point set and the boundary point set. That is to say, based on the method of selecting the optimal point in literature [25] from simple to complex, the dihedral angle and ‘‘used points’’ are added, and the corresponding inner edge adjacency list is set up to complete the mesh reconstruction of point cloud. 3) THE PRINCIPLE OF SELECTING THE OPTIMAL POINT In the triangular mesh reconstruction based on region growing, if the optimal point can be reasonably selected, it will have an important impact on the subsequent accurate display of the topological relationship of point cloud data and the improvement of the efficiency of the method. At this point {v0, v2, v4} are ‘‘used point’’ and should be extended as a matter of priority
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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
