Multi-Level Domain-Decomposition Strategy for Solving the Eikonal Equation with the Fast-Sweeping Method

Distance field from a surface geometry is used in several scientific algorithms and applications from computer graphics, visualization, computational fluid dynamics and more. Distance field can be calculated efficiently by solving the eikonal equation at each grid point using the fast-sweeping metho...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 29; no. 10; pp. 2297 - 2303
Main Authors:	Shrestha, Anup, Senocak, Inanc
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.10.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Accelerators Algorithms Computational fluid dynamics Computer graphics Computer memory Convergence CUDA Distributed memory Domain decomposition methods Eikonal equation fast-sweeping method Geometry Graphics processing units Heuristic algorithms Mathematical model MPI OpenACC Parallel processing signed distance field Strategy Surface geometry Sweeping Two dimensional displays
ISSN:	1045-9219, 1558-2183
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!