.png){kind=icon}
返回
Fast tree-based redistancing for level set computations
.png){kind=icon}
PRE
AI
DOI：10.1006/jcph.1999.6259.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Level set methods for moving interface problems require efficient techniques for transforming an interface to a globally defined function whose zero set is the interface, such as the signed distance to the interface. This paper presents efficient algorithms for this redistancing problem. The algorithms use quadtrees and triangulation to compute global approximate signed distance functions. A quadtree mesh is built to resolve the interface and the vertex distances are evaluated exactly with a robust search strategy to provide both continuous and discontinuous interpolants. Given a polygonal interface with N elements, our algorithms run in O (N) space and O(N log N) time. Two-dimensional numerical results show they are highly efficient in practice. (C) 1999 Academic Press.
Keyword:
moving interfaces
level sets
distance function
data structures
triangulation
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
暂无机构信息
引用论文
Development and Validation of the University of Washington Clinical Assessment of Music Perception Test华盛顿大学音乐知觉临床评估测试的开发和验证
OAAI
.png){kind=icon}
OAAI分享收藏Effects of Dietary Nitrate, Caffeine, and Their Combination on 20-km Cycling Time Trial Performance饮食中硝酸盐，咖啡因及其组合对20公里自行车时间试验性能的影响OAAI
OAAI分享收藏
查看更多内容