期刊
JOURNAL OF COMPUTATIONAL PHYSICS
卷 231, 期 6, 页码 2528-2536出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcp.2011.12.001
关键词
Local level-set; Level-set; Irregular domains; Hash tables; Reinitialization
资金
- 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
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据