Rapid Reconstruction of a Three-Dimensional Mesh Model Based on Oblique Images in the Internet of Things

One of the main targets of the Internet of Things (IoT) is the construction of smart cities, and many industries based on the IoT serve popular applications in a smart city. However, 3-D reconstruction constitutes a major difficulty in the construction of a smart city. In recent years, oblique photography technology has been widely applied in the rapid 3-D modeling and other aspects of smart cities. However, in the automatic construction of a 3-D mesh model for oblique photogrammetry, complex building geometries make it very difficult to construct a triangular mesh model. Therefore, a network construction method is needed that can not only effectively construct a 3-D mesh model but also address the results of auto-modeling for an oblique image. The representative network construction method is a huge triangulation network in which the constructed surface of the object does not satisfy the manifold features and it is inconvenient to optimize and edit the model, yielding a low network construction efficiency. To solve these problems, a new method for constructing a high-quality manifold mesh model is proposed in this paper. First, an adaptive octree division algorithm is used to divide the point cloud data into sub domains that cover each other. Then, a mesh reconstruction is performed in each sub domain, and an efficient mesh construction algorithm based on relabeling the vertices of the directed graph is proposed to construct the manifold mesh. Finally, a triangular facet orientation method is used to homogenize the normal vectors of the mesh. The experimental results proof that the proposed method greatly improves the mesh reconstruction, effectively reflects the model details, and possesses a strong anti-noise ability. Also, it has a good robustness and is particularly suitable for the 3-D reconstruction of large scenes and complex surfaces.

[1]  M. Shephard,et al.  A combined octree/delaunay method for fully automatic 3‐D mesh generation , 1990 .

[2]  James F. O'Brien,et al.  Interpolating and approximating implicit surfaces from polygon soup , 2005, SIGGRAPH Courses.

[3]  Tamal K. Dey,et al.  An Adaptive MLS Surface for Reconstruction with Guarantees , 2022 .

[4]  Huiyuan Xiong,et al.  Energy Recovery Strategy Numerical Simulation for Dual Axle Drive Pure Electric Vehicle Based on Motor Loss Model and Big Data Calculation , 2018, Complex..

[5]  Xiaojuan Sun,et al.  Primary resonance analysis and vibration suppression for the harmonically excited nonlinear suspension system using a pair of symmetric viscoelastic buffers , 2018, Nonlinear Dynamics.

[6]  Sunghee Choi,et al.  The power crust , 2001, SMA '01.

[7]  Marc Alexa,et al.  Anisotropic point set surfaces , 2006, AFRIGRAPH '06.

[8]  Vaughan R. Pratt,et al.  Direct least-squares fitting of algebraic surfaces , 1987, SIGGRAPH.

[9]  Paolo Cignoni,et al.  Marching intersections: an efficient resampling algorithm for surface management , 2001, Proceedings International Conference on Shape Modeling and Applications.

[10]  B. Huhle,et al.  Self-Localization in Scanned 3DTV Sets , 2007, 2007 3DTV Conference.

[11]  Adrian Hilton,et al.  Marching triangles: range image fusion for complex object modelling , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[12]  Kenneth I. Joy,et al.  Adaptive extraction of time-varying isosurfaces , 2004, IEEE Transactions on Visualization and Computer Graphics.

[13]  Gabriel Taubin,et al.  Detecting and reconstructing subdivision connectivity , 2002, The Visual Computer.

[14]  Jean-Philippe Pons,et al.  Spatio-Temporal Shape from Silhouette using Four-Dimensional Delaunay Meshing , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[15]  Gabriel Taubin,et al.  SSD: Smooth Signed Distance Surface Reconstruction , 2011, Comput. Graph. Forum.

[16]  Hao Xu,et al.  Using Octrees to Detect Changes to Buildings and Trees in the Urban Environment from Airborne LiDAR Data , 2015, Remote. Sens..

[17]  Subscribers Only Research on Redundant Data Reduction Algorithm of Laser Scanning Point Cloud Based on Curvature and Norma , 2017 .

[18]  Cristina Castagnetti,et al.  An Integrated Procedure to Assess the Stability of Coastal Rocky Cliffs: From UAV Close-Range Photogrammetry to Geomechanical Finite Element Modeling , 2017, Remote. Sens..

[19]  David Wettergreen,et al.  Real‐Time SLAM with Octree Evidence Grids for Exploration in Underwater Tunnels , 2007, J. Field Robotics.

[20]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[21]  Michael M. Kazhdan,et al.  Screened poisson surface reconstruction , 2013, TOGS.

[22]  Markus H. Gross,et al.  Dynamic Sampling and Rendering of Algebraic Point Set Surfaces , 2008, Comput. Graph. Forum.

[23]  N. Masetti,et al.  Broad-band characteristics of seven new hard X-ray selected cataclysmic variables , 2017, 1706.04005.

[24]  Ravi Krishna Kolluri,et al.  Provably good moving least squares , 2005, SIGGRAPH Courses.

[25]  Charles L. Lawson,et al.  $C^1$ surface interpolation for scattered data on a sphere , 1984 .

[26]  Hans-Peter Seidel,et al.  Multi-level partition of unity implicits , 2005, SIGGRAPH Courses.

[27]  Gholamhossein Dastghaibyfard,et al.  A faster circle-sweep Delaunay triangulation algorithm , 2012, Adv. Eng. Softw..

[28]  Chia-Hsiang Menq,et al.  Combinatorial manifold mesh reconstruction and optimization from unorganized points with arbitrary topology , 2002, Comput. Aided Des..

[29]  Markus H. Gross,et al.  Feature Preserving Point Set Surfaces based on Non‐Linear Kernel Regression , 2009, Comput. Graph. Forum.

[30]  Maximilian Buder,et al.  Memory Efficient Semi-Global Matching , 2012 .

[31]  Jean-Philippe Pons,et al.  Efficient Multi-View Reconstruction of Large-Scale Scenes using Interest Points, Delaunay Triangulation and Graph Cuts , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[32]  Pierre Alliez,et al.  A Survey of Surface Reconstruction from Point Clouds , 2017, Comput. Graph. Forum.