.png){kind=icon}
返回
A new parallel algorithm for constructing Voronoi tessellations from distributed input data
.png){kind=icon}
OA
AI
DOI：10.1016/j.cpc.2014.08.020.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a new parallel algorithm for generating consistent Voronoi diagrams from distributed input data for the purposes of simulation and visualization. The algorithm functions by building upon any serial Voronoi tessellation algorithm. The output of such a serial tessellator is used to determine the connectivity of the distributed domains without any assumptions about how points are distributed across those domains, and then in turn to build the portion of the global tessellation local to each domain using information from that domains neighbors. The result is a generalized methodology for adding distributed capabilities to serial tessellation packages. Results from several two-dimensional tests are presented, including strong and weak scaling of its current implementation. (c) 2014 Elsevier B.V. All rights reserved.
Keyword:
Voronoi
Parallel computing
Astrophysical flows
Geophysical flows
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
1.2W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏Point-centered domain decomposition for parallel molecular dynamics simulation并行分子动力学模拟的点中心区域分解
PREAI
分享收藏
查看更多内容