Geometric integration over irregular domains with application to level-set methods

Journal of Computational Physics

Volumn 226, Issue 2, 2007, Pages 1432-1443

  Min, Chohong ^a   Gibou, Frédéric ^b  

^a Kyung Hee University   (South Korea)

^b University of California   (United States)

Author keywords

Integration; Isosurfacing; Level set methods; Quadtree octree data structures

Indexed keywords

DROP BREAKUP; HYDROGELS; LEVEL MEASUREMENT;

GEOMETRIC APPROACHES; GEOMETRIC INTEGRATION; IRREGULAR DOMAINS; ISO-SURFACING; LEVEL SET METHOD; LEVEL-SET FUNCTION; LOW DIMENSIONAL; OCTREE DATA STRUCTURE; QUAD TREES; QUADTREE/OCTREE DATA STRUCTURE;

NUMERICAL METHODS;

EID: 34548687223     PISSN: 00219991     EISSN: 10902716     Source Type: Journal    
DOI: 10.1016/j.jcp.2007.05.032     Document Type: Article

References (20)

1. B.P. Carnerio, C. Silva, A.E. Kaufman, Tetra-cubes: an algorithm to generate 3d isosurfaces bases upon tetrahedra, Anais do IX SIBGRAPI, 1996, pp. 205-210.
2. Engquist B., Tornberg A.K., and Tsai R. Discretization of dirac delta functions in level set methods. J. Comput. Phys. 207 (2005) 28-51
3. Goodman J.E., and O'Rourke J. The Handbook of Discrete and Computational Geometry (1997), CRC Press LL
4. Grundmann A., and Moeller M. Invariant integration formulas for the n-simplex by combinatorial methods. SIAM J. Numer. Anal. 2 (1978) 282-290
5. Hammer C.P., and Stroud A.H. Numerical integration over simplexes. Math. Tables Other Aids Comput. 10 (1956) 137-139
6. Kuhn H.W. Some combinational lemmas in topology. IBM J. Res. Dev. 4 (1960) 508-524
7. Mayo A. The fast solution of Poisson's and the biharmonic equations on irregular regions. SIAM J. Numer. Anal. 21 (1984) 285-299
8. Min C. Simplicial isosurfacing in arbitrary dimension and codimension. J. Comput. Phys. 190 (2003) 295-310
9. C. Min, F. Gibou, A second order accurate level set method on non-graded adaptive Cartesian grids, Available at UCLA CAM report (06-22) http://www.math.ucla.edu/applied/cam/index.html, 2006 (in review).
10. Min C.-H. Local level set method in high dimension and codimension. J. Comput. Phys. 200 (2004) 368-382
11. Osher S., and Sethian J. Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations. J. Comput. Phys. 79 (1988) 12-49
12. Peng D., Merriman B., Osher S., Zhao H., and Kang M. A PDE-based fast local level set method. J. Comput. Phys. 155 (1999) 410-438
13. Russo G., and Smereka P. A remark on computing distance functions. J. Comput. Phys. 163 (2000) 51-67
14. Sallee J.F. The middle-cut triangulations of the n-cube. SIAM J. Alg. Disc. Methods 5 (1984) 407-419
15. Samet H. The Design and Analysis of Spatial Data Structures (1989), Addison-Wesley, New York
16. Samet H. Applications of Spatial Data Structures: Computer Graphics, Image Processing and GIS (1990), Addison-Wesley, New York
17. Smereka P. The numerical approximation of a delta function with application to level set methods. J. Comput. Phys. 211 (2006) 77-90
18. Sommerville D.M.Y. An Introduction to the Geometry of N Dimensions (1958), Dover Publications
19. Strain J. Tree methods for moving interfaces. J. Comput. Phys. 151 (1999) 616-648
20. Sussman M., and Fatemi E. An efficient interface-preserving level set redistancing algorithm and its application to interfacial incompressible fluid flow. SIAM J. Sci. Comp. 20 (1999) 1165-1191