期刊
JOURNAL OF COMPUTATIONAL PHYSICS
卷 178, 期 1, 页码 175-195出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1006/jcph.2002.7028
关键词
-
We present two fast and simple algorithms for approximating the distance function for given isolated points on uniform grids. The algorithms are then generalized to compute the distance to piecewise linear objects. By incorporating the geometry of Huygens' principle in the reverse order with the classical viscosity solution theory for the eikonal equation \delu\ = 1, the algorithms become almost purely algebraic and yield very accurate approximations. The generalized closest point formulation used in the second algorithm provides a framework for further extension to compute the distance accurately to smooth geometric objects on different grid geometries, without the construction of the Voronoi diagrams. This method provides a fast and simple translator of data commonly given in computational geometry to the volumetric representation used in level set methods. (C) 2002 Elsevier Science (USA).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据