Mesh size functions for implicit geometries and PDE-based gradient limiting

Engineering with Computers

Volumn 22, Issue 2, 2006, Pages 95-109

  Persson, Per Olof ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Background grid; Gradation control; Hamilton Jacobi; Mesh generation; Size function

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; GRADIENT METHODS; HAMILTONIANS; PARTIAL DIFFERENTIAL EQUATIONS;

BACKGROUND GRID; GRADATION CONTROL; GRADIENT LIMITING EQUATION; HAMILTON-JACOBI SOLVERS; MESH GENERATION; SIZE FUNCTION;

COMPUTER GRAPHICS;

EID: 33747620725     PISSN: 01770667     EISSN: 14355663     Source Type: Journal    
DOI: 10.1007/s00366-006-0014-1     Document Type: Article

References (31)

1. Peraire J, Vahdati M, Morgan K, Zienkiewicz OC (1987) Adaptive remeshing for compressible flow computations. J Comput Phys 72(2):449-466
2. Blacker TD, Stephenson MB (1991) Paving: A new approach to automated quadrilateral mesh generation. Int J Numer Methods Engrg 32:811-847
3. Persson PO, Strang G (2004) A simple mesh generator in MATLAB. SIAM Rev 46(2):329-345
4. Persson PO (2005) Mesh generation for implicit geometries. Ph.D. thesis, Massachusetts Institute of Technology
5. Ruppert J (1995) A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J Algorithms 18(3):548-585
6. Shewchuk JR (2002) Delaunay refinement algorithms for triangular mesh generation. Comput Geom 22(1-3):21-74
7. Owen SJ, Saigal S (2000) Surface mesh sizing control. Int J Numer Methods Engrg 47(1-3):497-511
8. Zhu J, Blacker T, Smith R (2002) Background overlay grid size functions. In: Proceedings of the 11th international meshing roundtable, pp 65-74. Sandia Nat. Lab., September 2002
9. Zhu J (2003) A new type of size function respecting premeshed entities. In: Proceedings of the 11th international meshing roundtable, pp 403-413. Sandia Nat. Lab., September 2003
10. Osher S, Sethian JA (1988) Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations. J Comput Phys 79(1):12-49
11. Sethian JA (1996) A fast marching level set method for monotonically advancing fronts. Proc Nat Acad Sci USA 93(4):1591-1595
12. Tsitsiklis JN (1995) Efficient algorithms for globally optimal trajectories. IEEE Trans Automat Control 40(9):1528-1538
13. Mauch SP (2003) Efficient algorithms for solving static Hamilton-Jacobi equations. Ph.D. thesis, Caltech, 2003
14. Sussman M, Smereka P, Osher S (1994) A level set approach for computing solutions to incompressible two-phase flow. J Comput Phys 114(1):146-159
15. Amenta N, Bern M (1998) Surface reconstruction by Voronoi filtering. In: Proceedings of the fourteenth annual symposium on computational geometry, SCG '98, pp 39-48. ACM, New York
16. Blum H (1973) Biological shape and visual science (Part I). J Theor Biol 38:205-287
17. Kimmel R, Shaked D, Kiryati N, Bruckstein AM (1995) Skeletonization via Distance Maps and Level Sets. Comput Vis Image Underst: CVIU 62(3):382-391
18. Siddiqi K, Bouix S, Tannenbaum A, Zucker S (1999) The Hamilton-Jacobi Skeleton. In: International conference on computer vision (ICCV), pp 828-834
19. Rumpf M, Telea A (2002) A continuous skeletonization method based on level sets. In: Proceedings of the symposium on data visualisation 2002, pp 151-ff. Eurographics Association
20. Borouchaki H, Hecht F, Frey PJ (1997) Mesh gradation control. In: Proceedings of the 6th international meshing roundtable, pp 131-141. Sandia Nat. Lab., October 1997
21. Frey PJ, Marechal L (1998) Fast adaptive quadtree mesh generation. In: Proceedings of the 7th international meshing roundtable, pp 211-224. Sandia Nat. Lab., October 1998
22. Yerry MA, Shephard MS (1983) A modified quadtree approach to finite element mesh generation. IEEE Comp Graph Appl 3(1):39-46
23. Hopf E (1965) Generalized solutions of non-linear equations of first order. J Math Mech 14:951-973
24. Harten A, Engquist B, Osher S, Chakravarthy SR (1987) Uniformly high order accurate essentially non-oscillatory schemes. J Comput Phys 71(2):231-303
25. Barth TJ, Sethian JA (1998) Numerical schemes for the Hamilton-Jacobi and level set equations on triangulated domains. J Comput Phys 145(1):1-40
26. Kimmel R, Sethian JA (1998) Fast marching methods on triangulated domains. Proc Nat Acad Sci 95:8341-8435
27. Covello P, Rodrigue G (2003) A generalized front marching algorithm for the solution of the eikonal equation. J Comput Appl Math 156(2):371-388
28. Persson PO (2005) Size functions and mesh generation for high-quality adaptive remeshing. In: Proceedings of the third MIT conference on computational fluid and solid mechanics. Cambridge, MA, 2005
29. Gonzalez RC, Woods RE (2002) Digital image processing, 2nd edn. Prentice-Hall, Englewood Cliffs
30. Chan T, Vese L (2001) Active contours without edges. IEEE Trans Image Process 10(2):266-277
31. Eriksson K, Estep D, Hansbo P, Johnson C (1996) Computational differential equations. Cambridge University Press, Cambridge