Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids

Journal of Computational Physics

Volumn 230, Issue 12, 2011, Pages 4437-4453

  Fortmeier, Oliver ^a   Martin Bucker H ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

High performance computing; K d tree; Re parametrization; Signed distance function; Two phase flow

Indexed keywords

DOMAIN DECOMPOSITION METHODS; IMAGE SEGMENTATION; PARALLEL FLOW; SET THEORY;

HIGH-PERFORMANCE COMPUTING; K-D TREE; LEVEL-SET FUNCTION; PARAMETRIZATIONS; PERFORMANCE COMPUTING; RE-PARAMETRIZATION; REINITIALIZATION; SIGNED DISTANCE FUNCTION; TETRAHEDRAL GRIDS; TWO PHASES FLOW;

TWO PHASE FLOW;

EID: 79955692258     PISSN: 00219991     EISSN: 10902716     Source Type: Journal    
DOI: 10.1016/j.jcp.2011.02.005     Document Type: Article

References (50)

1. Sethian J.A. Level Set Methods and Fast Marching Methods-Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science 1999, Cambridge University Press. Second ed.
2. Adalsteinsson D., Sethian J.A. Transport and diffusion of material quantities on propagating interfaces via level set methods. J. Comput. Phys. 2003, 185(1):271-288.
3. Chopp D.L. Another look at velocity extensions in the level set method. SIAM J. Sci. Comput. 2009, 31(5):3255-3273.
4. Chopp D.L. Computing minimal surfaces via level set curvature flow. J. Comput. Phys. 1993, 106(1):77-91.
5. Groß S., Reusken A. Finite element discretization error analysis of a surface tension force in two-phase incompressible flows. SIAM J. Numer. Anal. 2007, 45:1679-1700.
6. Amdahl G.M. Validity of the single processor approach to achieving large scale computing capabilities. Proc. of AFIPS Spring Joint Comput. Conf. 1967, 483-485. ACM, New York, NY, USA.
7. E. Dejnozkova, P. Dokladal, A parallel algorithm for solving the Eikonal equation, in: Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '03), vol. 3, 2003, pp. III.325-III.328.
8. Groß S., Reichelt V., Reusken A. A finite element based level set method for two-phase incompressible flows. Comput. Vis. Sci. 2006, 9(4):239-257.
9. Shu C.-W. High order numerical methods for time dependent Hamilton-Jacobi equations. Lecture Notes Series 2007, vol. 11:47-91. Institute for Mathematical Sciences National University of Singapore, World Scientific Press, Singapore. S. Goh, A. Ron, Z. Shen (Eds.).
10. Sethian J.A. A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. USA 1996, 93(4):1591-1595.
11. Kimmel R., Sethian J.A. Computing geodesic paths on manifolds. Proc. Natl. Acad. Sci. USA 1998, 95(15):8431-8435.
12. Sethian J.A., Vladimirsky A. Fast methods for the Eikonal and related Hamilton-Jacobi equations on unstructured meshes. Proc. Natl. Acad. Sci. USA 2000, 97(11):5699-5703.
13. Mémoli F., Sapiro G. Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces. J. Comput. Phys. 2001, 173(1):730-764.
14. M. Herrmann, A domain decomposition parallelization of the fast marching method, in: Annual Research Briefs 2003, Center for Turbulence Research, Stanford University, Stanford, CA, USA, 2003, pp. 213-225.
15. Herrmann M. A parallel Eulerian interface tracking/Lagrangian point particle multi-scale coupling procedure. J. Comput. Phys. 2010, 229(3):745-759.
16. M.C. Tugurlan, Fast marching methods-parallel implementation and analysis, Ph.d. thesis, Department of Mathematics, Louisiana State University, USA, 2008.
17. M. Breuß, E. Cristiani, P. Gwosdek, O. Vogel, A domain-decomposition-free parallelisation of the fast marching method, Preprint of the Department of Mathematics 250, Saarland University, Saarbrücken, submitted for publication, 2009.
18. Jeong W.-K., Whitaker R.T. A fast iterative method for Eikonal equations. SIAM J. Sci. Comput. 2008, 30(5):2512-2534.
19. Zhao H.-K. A fast sweeping method for Eikonal equations. Math. Comp. 2004, 74(250):603-627.
20. Danielsson P.-E. Euclidean distance mapping. Comput. Graphics Image Proc. 1980, 14:227-248.
21. Boué M., Dupuis P. Markov chain approximations for deterministic control problems with affine dynamics and quadratic cost in the control. SIAM J. Numer. Anal. 1999, 36(3):667-695.
22. Qian J., Zhang Y.-T., Zhao H.-K. Fast sweeping methods for Eikonal equations on triangular meshes. SIAM J. Numer. Anal. 2007, 45(1):83-107.
23. Zhao H. Parallel implementations of the fast sweeping method. J. Comput. Math. 2007, 25(4):421-429.
24. Hysing S., Turek S. The Eikonal equation: numerical efficiency vs. algorithmic complexity on quadrilateral grids. Proc. of Algoritmy 2005, Conference on Scientific Computing 2005, 22-31. Slovak University of Technology, Bratislava.
25. Fabbri R., Costa L.D.F., Torelli J.C., Bruno O.M. 2D Euclidean distance transform algorithms: a comparative survey. ACM Comput. Surv. 2008, 40(1):1-44.
26. Jones M.W., Baerentzen J.A., Sramek M. 3D distance fields: a survey of techniques and applications. IEEE Trans. Vis. Comput. Graphics 2006, 12(4):581-599.
27. Lee Y.-H., Horng S.-J., Seitzer J. Parallel computation of the Euclidean distance transform on a three-dimensional image array. IEEE Trans. Parallel Distrib. Syst. 2003, 14(3):203-212.
28. Wang Y.-R., Horng S.-J. An O(1)time algorithm for the 3D Euclidean distance transform on the CRCW PRAM model. IEEE Trans. Parallel Distrib. Syst. 2003, 14:973-982.
29. Hoff K.E., Culver T., Keyser J., Lin M., Manocha D. Fast computation of generalized Voronoi diagrams using graphics hardware. Proc. of 26th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '99) 1999, 277-286. ACM Press, New York, NY, USA.
30. Sud A., Govindaraju N., Gayle R., Manocha D. Interactive 3D distance field computation using linear factorization. Proc. of 2006 Symposium on Interactive 3D Graphics and Games (I3D '06) 2006, 117-124. ACM, New York, NY, USA.
31. Rong G., Tan T.-S. Jump flooding in GPU with applications to Voronoi diagram and distance transform. Proc. of 2006 Symposium on Interactive 3D Graphics and Games (I3D '06) 2006, 109-116. ACM, New York, NY, USA.
32. Rong G., Tan T.-S. Variants of jump flooding algorithm for computing discrete Voronoi diagrams. Proc. of Fourth International Symposium on Voronoi Diagrams in Science and Engineering (ISVD '07) 2007, 176-181. IEEE Computer Society, Washington, DC, USA.
33. Cao T.-T., Tang K., Mohamed A., Tan T.-S. Parallel banding algorithm to compute exact distance transform with the GPU. Proc. of 2010 Symposium on Interactive 3D Graphics and Games (I3D '10) 2010, 83-90. ACM, New York, NY, USA.
34. Schneider J., Kraus M., Westermann R. GPU-based real-time discrete Euclidean distance transforms with precise error bounds. Proc. of International Conference on Computer Vision Theory and Applications (VISAPP) 2009, 435-442. INSTICC Press, Setubal, Portugal.
35. Sussman M., Smereka P., Osher S. A level set approach for computing solutions to incompressible two-phase flow. J. Comput. Phys. 1994, 114(1):146-159.
36. Brackbill J.U., Kothe D.B., Zemach C. A continuum method for modeling surface tension. J. Comput. Phys. 1992, 100(2):335-354.
37. Chang Y.C., Hou T.Y., Merriman B., Osher S. A level set formulation of Eulerian interface capturing methods for incompressible fluid flows. J. Comput. Phys. 1996, 124(2):449-464.
38. Bentley J.L. Multidimensional binary search trees used for associative searching. Commun. ACM 1975, 18(9):509-517.
39. Friedman J.H., Bentley J.L., Finkel R.A. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 1977, 3(3):209-226.
40. Samet H. Foundations of Multidimensional and Metric Data Structures 2006, Morgan Kaufman Publishers Inc., San Francisco, CA, USA.
41. Thakur R., Rabenseifner R., Gropp W. Optimization of collective communication operations in MPICH. Int. J. High Perform. Comput. Appl. 2005, 19(1):49-66.
42. Groß S., Reusken A. Parallel multilevel tetrahedral grid refinement. SIAM J. Sci. Comput. 2005, 26(4):1261-1288.
43. O. Fortmeier, H.M. Bücker, A parallel strategy for a level set simulation of droplets moving in a liquid medium, in: J.M.L.M. Palma, M. Daydé, O. Marques, J.C. Lopes (Eds.), High Performance Computing for Computational Science - VECPAR 2010, Lecture Notes in Computer Science, vol. 6449, Springer, Berlin, 2011, pp. 200-209.
44. Groß S., Soemers M., Mhamdi A., Al-Sibai F., Reusken A., Marquardt W., Renz U. Identification of boundary heat fluxes in a falling film experiment using high resolution temperature measurements. Int. J. Heat Mass Transfer 2005, 48:5549-5562.
45. Karalashvili M., Groß S., Mhamdi A., Reusken A., Marquardt W. Incremental identification of transport coefficients in convection-diffusion systems. SIAM J. Sci. Comput. 2008, 3:3249-3269.
46. Bertakis E., Groß S., Grande J., Fortmeier O., Reusken A., Pfennig A. Validated simulation of droplet sedimentation with finite-element and level-set methods. Chem. Eng. Sci. 2010, 65(6):2037-2051.
47. Bücker H.M., Willkomm J., Groß S., Fortmeier O. Discrete and continuous adjoint approaches to estimate boundary heat fluxes in falling films. Optim. Methods Softw. 2011, 26(1):105-125.
48. Kennel M.B. Kdtree 2: Fortran 95 and C++ software to efficiently search for near neighbors in a multi-dimensional Euclidean space 2004, .
49. Karypis G., Kumar V. A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. J. Parallel Distrib. Comput. 1998, 48(1):71-95.
50. Gross-Hardt E., Slusanschi E., Bücker H.M., Pfennig A., Bischof C.H. Practical shape optimization of a levitation device for single droplets. Optim. Eng. 2008, 9(2):179-199.