Fast tree-based redistancing for level set computations (Q1302930)

The author presents efficient algorithms for 94 in moving interface 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. Two-dimensional numerical results show they are highly efficient in practice.