English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

. Graphs are commonly gridded by triangulation, i.e., thegeneration of a set of triangles for the points of the graph. This techniquecan also be used in a coupler to improve the commonality of datainterpolation between different horizontal model grids. This paper proposesa new parallel triangulation algorithm, PatCC1 (PArallelTriangulation algorithm with Commonality and parallelConsistency, version 1), for spherical and planar grids.Experimental evaluation results demonstrate the efficient parallelization ofPatCC1 using a hybrid of MPI (message passing interface) and OpenMP (Open Multi-Processing). They also show PatCC1 to havegreater commonality than existing parallel triangulation algorithms (i.e.,it is capable of handling more types of model grids) and that it guaranteesparallel consistency (i.e., it achieves exactly the same triangulationresult under different parallel settings).

PatCC1: an efficient parallel triangulation algorithm for spherical and planar grids with commonality and parallel consistency