In this paper, we present a parallel mesh surface generation approach for unorganized point clouds that runs on the graphics processing unit (GPU). Our approach integrates point cloud simplification, point cloud optimization, and local triangulation techniques into the same framework. The input point cloud will be processed through three steps of algorithms, which are 1) preprocessing: to generate the neighborhood table of points and estimate the normal vectors, 2) clustering: to group points into optimized clusters that minimize the shape approximation error, and 3) meshing: to connect the seed points in clusters to form the resultant triangular mesh surface. As the number of clusters can be specified by users, the number of vertices on resultant mesh surfaces is controlled. The algorithms exploited here are highly parallelized to take advantage of the single-instruction-multiple-data (SIMD) parallelism that is available on consumer-level graphics hardware with GPU. Moreover, to overcome memory limitation on graphics hardware, the algorithms in all these steps are able to process massive data in streaming mode.
- Design Engineering Division and Computers in Engineering Division
A Highly Parallel Approach to Meshing Scattered Point Data
- Views Icon Views
- Share Icon Share
- Search Site
Sheung, H, Mok, S, & Wang, CCL. "A Highly Parallel Approach to Meshing Scattered Point Data." Proceedings of the ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. Volume 2: 29th Computers and Information in Engineering Conference, Parts A and B. San Diego, California, USA. August 30–September 2, 2009. pp. 559-569. ASME. https://doi.org/10.1115/DETC2009-86936
Download citation file: