The Use of OpenMP Parallel Standards in Massive Data Delaunay Triangulation

Jian Li; Bing Xuan Guo; Xiong Wu Xiao

doi:10.4028/www.scientific.net/AMM.548-549.1143

Paper Titles

NURBS Curve Extraction from 2D Laser Sensor Data and 3D Simulated Data
p.1124

A New Method for Processing Symbolization Time Series
p.1130

Comparison Study of the Clustering Analysis Methods in the Load Time-Variation Research
p.1135

Study on Wavelet De-Noising of High Frequency Current Signal for Rotor Position Self-Sensing of PMSM
p.1139

The Use of OpenMP Parallel Standards in Massive Data Delaunay Triangulation
p.1143

Approaches in Pattern Recognition and Classification Based on Coin Images
p.1148

Global Color Composition for Curved Screen Display System
p.1152

An Iterative Indexing PLANO Frame Work for Graph Feature Mining
p.1156

Wideband LFM Signal Parameter Estimation Based on Compressed Sensing Theory
p.1160

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 548-549The Use of OpenMP Parallel Standards in Massive...

The Use of OpenMP Parallel Standards in Massive Data Delaunay Triangulation

Abstract:

This paper uses OpenMP parallel standardsin massive data Delaunay triangulation.Based on the Fork/Join parallel mode in OpenMP, a quad-tree is designed to divide and map the point cloud data.And the hierarchical implementation of triangulation and merging operations are based on it. A WFM-JLP algorithm is used to schedule triangulationand merging operations in order to achieve better load balancing. Experiment show the proposed method can greatly reduce the real-time memory and computing time.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 548-549)

Pages:

1143-1147

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.548-549.1143

Citation:

Cite this paper

Online since:

April 2014

Authors:

Jian Li*, Bing Xuan Guo, Xiong Wu Xiao

Keywords:

Delaunay Triangulation, Load Balancing, OpenMP, Parallel Computing, Quad-Tree, WFM-JLP

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Openmp A. OpenMP Application Program Interface, v. 3. 0. May, (2008).

Google Scholar

[2] Isenburg M, Liu Y, Shewchuk J, et al. Streaming computation of Delaunay triangulations. ACM Trans. Graph. 2006, 25: 1049-1056.

DOI: 10.1145/1141911.1141992

Google Scholar

[3] Wu H, Guan X, Gong J. ParaStream: A parallel streaming Delaunay triangulation algorithm for LiDAR points on multicore architectures. Computers & Geosciences. 2011, 37(9): 1355-1363.

DOI: 10.1016/j.cageo.2011.01.008

Google Scholar

[4] J. Li, D. Li, and Z. Shao, A streaming data Delaunay triangulation algorithm based on parallel computing, Wuhan Daxue Xuebao (Xinxi Kexue Ban)/Geomatics and Information Science of Wuhan University, vol. 38, pp.794-798, (2013).

Google Scholar

[5] Amato N M, An P. Task scheduling and parallel mesh-sweeps in transport computations. Texas A&M University, Department of Computer Science, Technical Report 00-009. (2000).

Google Scholar

[6] Anger F D, Hwang J J, Chow Y C. Scheduling with sufficient loosely coupled processors. Journal of Parallel and Distributed Computing. 1990, 9(1): 87-92.

DOI: 10.1016/0743-7315(90)90116-7

Google Scholar

[7] Chen M B, Chuang T R, Wu J J. Parallel divide-and-conquer scheme for 2D Delaunay triangulation. Concurrency and Computation: Practice and Experience. 2006, 18(12): 1595-1612.

DOI: 10.1002/cpe.1007

Google Scholar

[8] Shewchuk J R. Triangle: Engineering a 2D Quality Mesh Generator andDelaunay Triangulator. Applied Computational Geometry: Towards Geometric Engineering, Lin M C, Manocha D, Springer-Verlag, 1996: 1148, 203-222.

DOI: 10.1007/bfb0014497

Google Scholar

[9] Katajainen J, Koppinen M. Constructing Delaunay triangulations by merging buckets in quad tree order. FundamentaInformaticae XI, 1998, 11(3): 275-288.

DOI: 10.3233/fi-1988-11305

Google Scholar