A fast sweeping method for eikonal equations on implicit surfaces

Tony Wong Shing-Yu Leung

Numerical Analysis and Scientific Computing mathscidoc:1912.43193

Journal of Scientific Computing, 67, (3), 837-859, 2016.6
We propose a computational efficient yet simple numerical algorithm to solve the surface eikonal equation on general implicit surfaces. The method is developed based on the embedding idea and the fast sweeping methods. We first approximate the solution to the surface eikonal equation by the Euclidean weighted distance function defined in a tubular neighbourhood of the implicit surface, and then apply the efficient fast sweeping method to numerically compute the corresponding viscosity solution. Unlike some other embedding methods which require the radius of the computational tube satisfies h = O ( x ) for some h = O ( x ) , our approach allows h = O ( x ) . This implies that the total number of grid points in the computational tube is optimal and is given by h = O ( x ) for a co-dimensional one surface in h = O ( x ) . The method can be easily extended to general static HamiltonJacobi equation defined on implicit
No keywords uploaded!
[ Download ] [ 2019-12-21 11:28:46 uploaded by Shing_Yu_Leung ] [ 963 downloads ] [ 0 comments ]
@inproceedings{tony2016a,
  title={A fast sweeping method for eikonal equations on implicit surfaces},
  author={Tony Wong, and Shing-Yu Leung},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191221112846425752753},
  booktitle={Journal of Scientific Computing},
  volume={67},
  number={3},
  pages={837-859},
  year={2016},
}
Tony Wong, and Shing-Yu Leung. A fast sweeping method for eikonal equations on implicit surfaces. 2016. Vol. 67. In Journal of Scientific Computing. pp.837-859. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191221112846425752753.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved