“Novel Algorithm for Sparse and Parallel Fast Sweeping: Eicient Computation of Sparse Signed Distance Fields” by Museth
Conference:
Type(s):
Entry Number: 74
Title:
- Novel Algorithm for Sparse and Parallel Fast Sweeping: Eicient Computation of Sparse Signed Distance Fields
Session/Category Title: Don't Be Scared - It's Only Math
Presenter(s)/Author(s):
Abstract:
We present a new efficient algorithm for computing signed distance fields by means of the Fast Sweeping Method. Unlike existing algorithms ours is explicitly designed to explore the benefits of sparse (vs dense) grids as well as concurrency, i.e. mutli-threading.
References:
Miles Detrixhe, FréDéRic Gibou, and Chohong Min. 2013. A Parallel Fast Sweeping Method for the Eikonal Equation. J. Comput. Phys. 237 (March 2013), 46–55. Google ScholarDigital Library
Ken Museth. 2013. VDB: High-Resolution Sparse Volumes with Dynamic Topology. ACM Trans. Graph. 32, 3, Article 27 (July 2013), 22 pages. Google ScholarDigital Library
James A. Sethian. 1996. A fast marching level set method for monotonically advancing fronts. Proc. of the National Academy of Sciences of the USA 93, 4 (February 1996), 1591–1595. Google ScholarCross Ref
Hongkai Zhao. 2004. Fast Sweeping Method for Eikonal Equations. Math. Comp. 74 (2004), 603–627. Google ScholarCross Ref
Hongkai Zhao. 2007. Parallel implementation of the fast sweeping method. Journal of Computational Mathematics 25, 4 (2007), 421–429.
