期刊
COMPUTER PHYSICS COMMUNICATIONS
卷 172, 期 2, 页码 86-108出版社
ELSEVIER
DOI: 10.1016/j.cpc.2005.06.009
关键词
Delaunay triangulation; Voronoi tessellation; data-parallelism; task-parallelism; particle simulations
A parallel algorithm for regular triangulations is presented. For the purpose of fully dynamic and kinetic particle simulations it allows vertex insertion, deletion, movement, and weight changes. We describe new algorithms for incremental construction of regular triangulations, parallel vertex deletion and insertion. Finally, a parallel Lawson flip algorithm for vertex displacements is presented. The performance analysis demonstrates a significant parallel efficiency for various system sizes and performed changes. (C) 2005 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据