Journal
JOURNAL OF COMPUTATIONAL PHYSICS
Volume 231, Issue 6, Pages 2528-2536Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcp.2011.12.001
Keywords
Local level-set; Level-set; Irregular domains; Hash tables; Reinitialization
Funding
- ONR [N00014-11-1-0027]
- National Science Foundation [CHE 1027817]
- Department of Energy [DE-FG02-08ER15991]
- Institute for Collaborative Biotechnologies from the US Army Research Office [W911NF-09-D-0001]
- W.M. Keck Foundation
Ask authors/readers for more resources
We present a local level-set method based on the hash table data structure, which allows the storage of only a band of grid points adjacent to the interface while providing an O(1) access to the data. We discuss the details of the construction of the hash table data structure as well as the advection and reinitialization schemes used for our implementation of the level-set method. We propose two dimensional numerical examples and compare the results to those obtained with a quadtree data structure. Our study indicates that the method is straightforward to implement but suffers from limitations that make it less efficient than the quadtree data structure. Published by Elsevier Inc.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available