A Fast Scanning Algorithm for Extension Velocities in Level Set Methods

Abstract:

A novel fast scanning method is proposed to further stabilize and fasten the construction of extension velocities in level set method. Based on the partial differential equations and scanning schemes, the proposed algorithm only needs our four times to sweep and simple operations to build an extension velocity in O(N) time, where N is the number of grid points. The extended velocities are continuous and preserve the signed distance function without need for re-initialization. Moreover, the fast scanning algorithm has no dependence on the construction of the signed distance function. At last, the presented classical examples show that the proposed approach is accurate, simple and efficient.

• Periodical: Advanced Materials Research (Volumes 328-330)
• Pages: 677-680
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.328-330.677
• Online since: September 2011
• Authors: Gao Fei Ouyang, Yong Cong Kuang, Xian Min Zhang
• Keywords: Extension Velocity, Fast Scanning Algorithm, Level Set Method (LSM)

References

[1] S. Osher, J.A. Sethian: Journal of Computational Physics. Vol. 79(1988), p.12.

[2] J.A. Sethian: Cambridge University Press (1999).

[3] Y.W. Michael, W. Xiaoming, G. Dongming: Computer methods in applied mechanics and engineering. Vol. 192(2003), pp.227-246.

[4] R. Malladi, J.A. Sethian, and B.C. Vemuri: IEEE Trans. PAMI, Vol. 17(1995), p.158.

[5] Z. Hong-Kai, T. Chan, B. Merriman and S. Osher: Journal of Computational Physics, Vol. 127(1996), p.179.

[6] D. Adalsteinsson, J.A. Sethian: Journal of Computational physics. Vol. 148(1999), p.148.