.png){kind=icon}
Return
Fast tree-based redistancing for level set computations
.png){kind=icon}
PRE
AI
DOI：10.1006/jcph.1999.6259.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
moving interfaces
level sets
distance function
data structures
triangulation
Journal
IF:
3.8
Papers:
1.6W
Citations:
7.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveEffects of Dietary Nitrate, Caffeine, and Their Combination on 20-km Cycling Time Trial Performance
OAAI
OAAIShareSaveShareSaveShareSave
View more