Journal
COMPUTER PHYSICS COMMUNICATIONS
Volume 172, Issue 2, Pages 86-108Publisher
ELSEVIER
DOI: 10.1016/j.cpc.2005.06.009
Keywords
Delaunay triangulation; Voronoi tessellation; data-parallelism; task-parallelism; particle simulations
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available