Parallel hybrid mesh adaptation by refinement and coarsening

Tang, Jing; Cui, Pengcheng; Li, Bin; Zhang, Yaobin; Si, Hang

doi:10.1016/j.gmod.2020.101084

Cited by 11 publications

(6 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As we show in the right side of Figure 3, the kisquadrille tiling has this advantageous property, each tile can be cut to four tiles, for example, the y − type tile shown by orange color is divided into two y − , one x − and one x + tiles, each of which has half of the side lengths as the original tile has. This property is useful not only in imaging, but in Geographical Information Systems and in various simulation directed disciplines (e.g., Lie, 2019; Lowther, 1989; Moulitsas & Karypis, 2001; Tang et al, 2020; Wang, Yang, et al, 2020). We will come back to this point in Section 4.…”

Section: Preliminariesmentioning

confidence: 99%

A digital geometry on the tetrakis square tiling—Distance and coarsening

Nagy

2023

Transactions in GIS

View full text Add to dashboard Cite

There are various tessellations of the plane, including three regular and eight semi‐regular tilings. The square grid is self‐dual, and the hexagonal and triangular tilings are dual to each other. The semi‐regular tessellations are based on more than one type of regular tiles, while their dual tilings are based on a sole but not a regular tile. In various applications, including Geographical Information Systems, it is worth considering non‐regular grids instead of the most used square grid. In this article, we are interested in the dual of the semi‐regular truncated quadrille tiling, T(8,8,4), which is also known as the Khalimsky grid due to its connectedness structure. In our grid, which is called the tetrakis square or kisquadrille tiling, while it is denoted by D(8,8,4), we consider the right‐angled triangle regions of the usual two‐dimensional Khalimsky graph as tiles/pixels. We give an easy‐to‐use coordinate frame addressing the triangles of all the four different orientations. Neighbor relations are described mathematically based on this frame. Based on the shortest path algorithm, a closed formula is proven to compute the digital, that is, path‐based distance on this grid. Some properties of the distance function have also been studied. Hierarchical coarsening is a frequently used technique both in Geometric and Geographical Information Systems to rescale some parts of the map. The tetrakis square grid is apt for hierarchical coarsening, and thus, it can easily be used in image compression and multigrid and other related methods.

show abstract

Section: Preliminariesmentioning

confidence: 99%

A digital geometry on the tetrakis square tiling—Distance and coarsening

Nagy

2023

Transactions in GIS

View full text Add to dashboard Cite

show abstract

“…The procedure combines concurrent computation and computational geometry to overcome the limitations of traditional algorithms. [9] By integrating dynamic recovery of geometric boundary features and efficient concurrent processing, the proposed procedure aims to improve the efficiency and precision of pyramidal grid development, even at larger scales.…”

Section: Related Workmentioning

confidence: 99%

Concurrent Development of Accurate and Efficient Pyramidal Meshes for Stereoscopic Object Frameworks

2023

ijfans

View full text Add to dashboard Cite

The development of accurate and efficient pyramidal meshes plays a vital role in various scientific and engineering applications. This research paper presents a novel procedure and apparatus for generating pyramidal meshes based on stereoscopic object frameworks. The proposed procedure incorporates boundary sampling, initial mesh construction, concurrent territory division, grid subdivision, grid optimization, and subregion mesh updates to ensure the preservation of model boundary features during the grid development process. By integrating stereoscopic model information into the procedure, the procedure enables concurrent processing and efficient pyramidal grid development while maintaining the essential geometric properties of the model's boundaries.

show abstract

“…Elements entities with the same destination ID should be collected together and renumbered locally. This process is similar to dynamic load balancing repartitioning after parallel mesh adaptation 20 if we regard the grids owned by different processors before the partition as a raw partition. We equally distribute M new partitions to N preprocessing processors to assemble new sub‐meshes.…”

Section: Overview Of the Designmentioning

confidence: 99%

ParTransgrid: A scalable parallel preprocessing tool for unstructured‐grid cell‐centered computational fluid dynamics applications

et al. 2021

Self Cite

View full text Add to dashboard Cite

The development of a basic scalable preprocessing tool is the key routine to accelerate the entire computational fluid dynamics (CFD) workflow toward the exascale computing era. In this work, a parallel preprocessing tool, called ParTransgrid, is developed to translate the general grid format like CFD General Notation System into an efficient distributed mesh data format for large-scale parallel computing. Through ParTransgrid, a flexible face-based parallel unstructured mesh data structure designed in Hierarchical Data Format can be obtained to support various cell-centered unstructured CFD solvers. The whole parallel preprocessing operations include parallel grid I/O, parallel mesh partition, and parallel mesh migration, which are linked together to resolve the run-time and memory consumption bottlenecks for increasingly large grid size problems. An inverted index search strategy combined with a multi-master-slave communication paradigm is proposed to improve the pairwise face matching efficiency and reduce the communication overhead when constructing the distributed sparse graph in the phase of parallel mesh partition. And we present a simplified owner update rule to fast the procedure of raw partition boundaries migration and the building of shared faces/nodes communication mapping list between new sub-meshes with an order of magnitude of speed-up. Experiment results reveal that ParTransgrid can be easily scaled to billion-level grid CFD applications, the preparation time for parallel computing with hundreds of thousands of cores is reduced to a few minutes.

show abstract

Parallel hybrid mesh adaptation by refinement and coarsening

Cited by 11 publications

References 45 publications

A digital geometry on the tetrakis square tiling—Distance and coarsening

A digital geometry on the tetrakis square tiling—Distance and coarsening

Concurrent Development of Accurate and Efficient Pyramidal Meshes for Stereoscopic Object Frameworks

ParTransgrid: A scalable parallel preprocessing tool for unstructured‐grid cell‐centered computational fluid dynamics applications

Contact Info

Product

Resources

About