Fast Tree-Based Redistancing for Level Set Computations

Journal of Computational Physics

Volumn 152, Issue 2, 1999, Pages 664-686

  Strain, John ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Data structures; Distance function; Level sets; Moving interfaces; Triangulation

Indexed keywords

NUMERICAL METHODS; TREES (MATHEMATICS);

DEFINED FUNCTIONS; DISTANCE FUNCTIONS; INTERFACE PROBLEMS; LEVEL SET; LEVEL SET METHOD; MOVING INTERFACE; QUAD TREES; SIGNED DISTANCE; TREE-BASED; ZERO-SETS;

TRIANGULATION;

EID: 0001155253     PISSN: 00219991     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcph.1999.6259     Document Type: Article

References (19)

1. D. A. Adalsteinsson and J. A. Sethian, The Fast Construction of Extension Velocities in Level Set Methods, Technical Report PAM-738, Center for Pure and Applied Mathematics, University of California, Berkeley, 1997.
2. S. Chen, B. Merriman, S. Osher, and P. Smereka, A simple level set method for solving Stefan problems, J. Comput. Phys. 135, 8 (1997).
3. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications (Springer-Verlag, Berlin, 1997).
4. H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision, Comm. ACM 29, 669 (1986).
5. M. McAllister, D. Kirkpatrick, and J. Snoeyink, A compact piecewise-linear Voronoi diagram for convex sites in the plane, Discrete Comput. Geom. 15, 73 (1996).
6. S. J. Osher and J. A. Sethian, Front propagation with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations, J. Comput. Phys. 79, 12 (1988).
7. D. Peng, B. Merriman, S. Osher, H. Zhao, and M. Kang, A PDE Based Fast Local Level Set Method, CAM Report 98-25, Program in Computational and Applied Mathematics, University of California, Los Angeles, 1998.
8. A. Schmidt, Computation of three dimensional dendrites with finite elements, J. Comput. Phys. 125, 293 (1996).
9. J. Sethian, Level Set Methods (Cambridge Univ. Press, Cambridge, UK, 1996).
10. J. A. Sethian and J. Strain, Crystal growth and dendritic solidification, J. Comput. Phys. 98, 231 (1992).
11. J. R. Shewchuk, Triangle: A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator, C code, School of Computer Science, Carnegie Mellon University, 1995.
12. E. Stein, Singular Integrals and Differentiability Properties of Functions (Princeton Univ. Press, Princeton, NJ, 1970).
13. J. Strain, Tree methods for moving interfaces, J. Comput. Phys., in press.
14. J. Strain, Modular methods for moving interfaces, J. Comput. Phys., in press.
15. M. Sussman, P. Smereka, and S. Osher, A level set approach for computing solutions to incompressible two-phase flow, J. Comput. Phys. 114, 146 (1994).
16. J. Taylor, J. W. Cahn, and C. A. Handwerker, Geometric models of crystal growth, Acta Met. Mat. 40, 1443 (1992).
17. C. Truesdell and R. A. Toupin, The classical field theories, in Handbuch der Physik III/1, edited by S. Flügge (Springer-Verlag, Berlin, 1960).
18. F. W. Wilson, R. K. Goodrich, and W. Spratte, Lawson's algorithm is nearly optimal for controlling error bounds, SIAM J. Numer. Anal. 27, 190 (1990).
19. C. K. Yap, An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments, Discrete Comput. Geom. 2, 365 (1987).