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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 29; číslo 10; s. 2297 - 2303
Hlavní autoři:	Shrestha, Anup, Senocak, Inanc
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.10.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!