PatCC1: an efficient parallel triangulation algorithm for spherical and planar grids with commonality and parallel consistency
<p>Graphs are commonly gridded by triangulation, i.e., the generation of a set of triangles for the points of the graph. This technique can also be used in a coupler to improve the commonality of data interpolation between different horizontal model grids. This paper proposes a new parallel tr...
Main Authors: | H. Yang, L. Liu, C. Zhang, R. Li, C. Sun, X. Yu, H. Yu, Z. Zhang, B. Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Copernicus Publications
2019-07-01
|
Series: | Geoscientific Model Development |
Online Access: | https://www.geosci-model-dev.net/12/3311/2019/gmd-12-3311-2019.pdf |
Similar Items
-
Parallelism-Oriented Dynamic Incremental Delaunay Triangulation Algorithm
by: YANG Haoyu, LIU Li, ZHANG Cheng, YU Hao
Published: (2020-01-01) -
PAT :
an interactive fortran parallelizing assistant tool
by: Smith, Kevin Scott
Published: (2006) -
Parallel Construction of LocalClearance Triangulations
by: Gummesson, Simon, et al.
Published: () -
Parallel Construction of Local Clearance Triangulations
by: Gummesson, Simon, et al.
Published: (2019) -
Parallel Construction of Local Clearance Triangulations
by: Gummesson, Simon, et al.
Published: (2019)