A local level-set method using a hash table data structure

Journal of Computational Physics

Volumn 231, Issue 6, 2012, Pages 2528-2536

  Brun, Emmanuel ^a   Guittet, Arthur ^a   Gibou, Frédéric ^a  

^a University of California   (United States)

Author keywords

Hash tables; Irregular domains; Level set; Local level set; Reinitialization

Indexed keywords

DIGITAL STORAGE; DROP BREAKUP; LEVEL MEASUREMENT; NUMERICAL METHODS;

GRID POINTS; HASH TABLE; IRREGULAR DOMAINS; LEVEL SET; LEVEL SET METHOD; LOCAL LEVEL-SET; QUAD-TREES DATA STRUCTURE; REINITIALIZATION; TWO-DIMENSIONAL;

DATA STRUCTURES;

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

References (23)

1. Adalsteinsson D., Sethian J. A fast level set method for propagating interfaces. J. Comput. Phys. 1995, 118:269-277.
2. Bell J.B., Colella P., Glaz H.M. A second order projection method for the incompressible Navier-Stokes equations. J. Comput. Phys 1989, 85:257-283.
3. Cormen T.H. Introduction to Algorithms 2001, The MIT press.
4. Losasso F., Gibou F., Fedkiw R. Simulating water and smoke with an octree data structure. ACM Trans. Graph. (SIGGRAPH Proc.) 2004, 457-462.
5. Nielsen Ken Museth Michael B. Dynamic tubular grid: an efficient data structure and algorithms for high resolution level sets. J. Sci. Comput. 2006, 26(3). 10.1007/s10915-005-9062-8.
6. Min C., Gibou F. Geometric integration over irregular domains with application to level set methods. J. Comput. Phys. 2007, 226:1432-1443.
7. Min C., Gibou F. A second order accurate level set method on non-graded adaptive Cartesian grids. J. Comput. Phys. 2007, 225:300-321.
8. Olsson E., Kreiss G. A conservative level set method for two phase flow. J. Comput. Phys. 2005, 210:225-246.
9. Osher S., Fedkiw R. Level Set Methods and Dynamic Implicit Surfaces 2002, Springer-Verlag, New York, NY.
10. Osher S., Sethian J. Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations. J. Comput. Phys. 1988, 79:12-49.
11. Popinet S. Gerris: a tree-based adaptive solver for the incompressible euler equations in complex geometries. J. Comput. Phys. 2003, 190:572-600.
12. Russo G., Smereka P. A remark on computing distance functions. J. Comput. Phys. 2000, 163:51-67.
13. Samet H. The Design and Analysis of Spatial Data Structures 1989, Addison-Wesley, New York.
14. Samet H. Applications of Spatial Data Structures: Computer Graphics. Image Processing and GIS 1990, Addison-Wesley, New York.
15. Sethian J. A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. 1996, 93:1591-1595.
16. Sethian J.A. Level Set Methods and Fast Marching Methods 1999, Cambridge University Press, Cambridge.
17. Shu C.-W., Osher S. Efficient implementation of essentially non-oscillatory shock capturing schemes. J. Comput. Phys. 1988, 77:439-471.
18. Steele K., Cline D., Egbert P.K., Dinerstein J. Modeling and rendering viscous liquids. Comput. Anim. Virtual Worlds 2004, 15(3-4):183-192.
19. Strain J. Tree methods for moving interfaces. J. Comput. Phys. 1999, 151:616-648.
20. Sussman M., Fatemi E., Smereka P., Osher S. An improved level set method for incompressible two-phase flows. Comput. Fluids 1998, 27:663-680.
21. Teschner M., Kimmerle S., Heidelberger B., Zachmann G., Raghupathi L., Fuhrmann A., Cani M.P., Faure F., Magnenat-Thalmann N., Strasser W., et al. Collision Detection for Deformable Objects. Computer Graphics Forum 2005, vol. 24:61-81. Wiley Online Library.
22. Tsitsiklis J. Efficient algorithms for globally optimal trajectories. IEEE Trans. Autom. Control 1995, 40:1528-1538.
23. Xiu D., Karniadakis G. A semi-Lagrangian high-order method for Navier-Stokes equations. J. Comput. Phys. 2001, 172:658-684.