Discrete Point Cloud Filtering And Searching Based On VGSO Algorithm

Author(s):  
Fengjun Hu ◽  
Yanwei Zhao ◽  
Wanliang Wang ◽  
Xianping Huang
Keyword(s):  
Author(s):  
Van Sinh Nguyen ◽  
Manh Ha Tran ◽  
Ba Cong Nhan

Reconstructing the surface of 3D point clouds is a reconstruction from a cloud of 3D points to a triangular mesh. This process approximates a discrete point cloud by a continuous/smooth surface depending on the input data and the applications of users. In this paper, we propose a complete method to reconstruct an elevation surface from 3D point clouds. The method consists of three steps. In the first step, we triangulate an elevation surface of 3D point cloud structured in a 3D grid. In the second step, we remove the outward triangles to deal with concave regions on the boundary of the triangular mesh. In the third step, we reconstruct this surface by filling the hole of triangular mesh. Our method could process very fast for triangulating the surface, preserve the topology and characteristic of the input surface after reconstruction.


2021 ◽  
Author(s):  
Qirui Hu ◽  
Zhiwei Lin ◽  
Jianzhong Fu

Abstract Bridging the different parts together is considered a simple but effective strategy to reduce the number of piercing operations during laser cutting. However, fast bridging is never an easy task. In this paper, we present a near-linear bridging algorithm for the input parts with the shortest total bridge length. At first, the input part contours are discretized into a point cloud, then the point cloud is triangulated with the Delaunay standard. The shortest line segments between any two adjacent parts are found in the triangles connecting the two parts. These segments are finally extended into bridges. To solve the problem of the damages to the contour characteristics caused by the bridges, some restrictions are set on the screening of the discrete point cloud and the Delaunay triangles. This algorithm not only ensures the minimum total distance of all bridges, but also avoids the problem of generating bridge loops. Computational experiments show that the proposed bridging algorithm is much faster than that in existing commercial software. The feasibility and superiority of the algorithm are verified by actual lasering cutting experiments.


Author(s):  
Xiangkun Guo ◽  
Sihuan Chen ◽  
Hu Lin ◽  
Hongliang Wang ◽  
Shuai Wang

2016 ◽  
Vol 136 (8) ◽  
pp. 1078-1084
Author(s):  
Shoichi Takei ◽  
Shuichi Akizuki ◽  
Manabu Hashimoto

Author(s):  
Jiayong Yu ◽  
Longchen Ma ◽  
Maoyi Tian, ◽  
Xiushan Lu

The unmanned aerial vehicle (UAV)-mounted mobile LiDAR system (ULS) is widely used for geomatics owing to its efficient data acquisition and convenient operation. However, due to limited carrying capacity of a UAV, sensors integrated in the ULS should be small and lightweight, which results in decrease in the density of the collected scanning points. This affects registration between image data and point cloud data. To address this issue, the authors propose a method for registering and fusing ULS sequence images and laser point clouds, wherein they convert the problem of registering point cloud data and image data into a problem of matching feature points between the two images. First, a point cloud is selected to produce an intensity image. Subsequently, the corresponding feature points of the intensity image and the optical image are matched, and exterior orientation parameters are solved using a collinear equation based on image position and orientation. Finally, the sequence images are fused with the laser point cloud, based on the Global Navigation Satellite System (GNSS) time index of the optical image, to generate a true color point cloud. The experimental results show the higher registration accuracy and fusion speed of the proposed method, thereby demonstrating its accuracy and effectiveness.


Sign in / Sign up

Export Citation Format

Share Document