Robust generation of high-quality unstructured meshes on realistic biomedical geometry

International Journal for Numerical Methods in Engineering

Volumn 65, Issue 6, 2006, Pages 943-973

  Ito, Yasushi ^a   Shum, P Corey ^a   Shih, Alan M ^a   Soni, Bharat K ^a   Nakahashi, Kazuhiro ^b  

^a University of Alabama at Birmingham   (United States)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

Advancing front method; CT; Image processing; Mesh coarsening; MRI; Unstructured mesh generation

Indexed keywords

COMPUTER SIMULATION; COMPUTERIZED TOMOGRAPHY; FEATURE EXTRACTION; IMAGE PROCESSING; IMAGE QUALITY; IMAGE SEGMENTATION; MAGNETIC RESONANCE IMAGING; MEDICAL IMAGING;

ADVANCING FRONT METHOD; MESH COARSENING; UNSTRUCTURED MESH GENERATION; VOLUME MESHING METHOD;

COMPUTATIONAL GEOMETRY;

COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; COMPUTERIZED TOMOGRAPHY; FEATURE EXTRACTION; IMAGE PROCESSING; IMAGE QUALITY; IMAGE SEGMENTATION; MAGNETIC RESONANCE IMAGING; MEDICAL IMAGING;

EID: 31644438563     PISSN: 00295981     EISSN: None     Source Type: Journal    
DOI: 10.1002/nme.1482     Document Type: Article

References (21)

1. Shewchuk JR. What is a good linear element? Interpolation, conditioning, and quality measures. Proceedings of the 11th International Meshing Roundtable, Ithaca, NY, 2002; 115-126.
2. Ito Y, Nakahashi K. Direct surface triangulation using stereolithography data. AIAA Journal 2002; 40(3): 490-496.
3. Ito Y, Nakahashi K. Surface triangulation for polygonal models based on CAD data. International Journal for Numerical Methods in Fluids 2002; 39(1):75-96.
4. Hoppe H. Progressive meshes. Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques. ACM Press: New York. 1996; 99-108.
5. Heckbert PS, Garland M. Optimal triangulation and quadric-based surface simplification. Computational Geometry 1999; 14(1-3):49-65.
6. Miller GL, Talmor D, Teng S-H. Optimal coarsening of unstructured meshes. Journal of Algorithms 1999; 31:29-65.
7. Ollivier-Gooch C. Coarsening unstructured meshes by edge contraction. International Journal for Numerical Methods in Engineering 2003; 57:391-414.
8. Frey PJ. Generation and adaptation of computational surface meshes from discrete anatomical data. International Journal for Numerical Methods in Engineering 2004; 60:1049-1074.
9. Yamakawa S, Shimada K. Triangular/quadrilateral remeshing of an arbitrary polygonal surface via packing bubbles. Proceedings of Geometric Modeling and Processing, Beijing, China, 2004; 153-162.
10. Lorensen WE, Cline HE. Marching cubes: a high resolution 3D surface construction algorithm. Computer Graphics 1987; 21(4):163-169.
11. Insight Segmentation and Registration Toolkit (ITK), http://www.itk.org/
12. Visualization ToolKit (VTK), http://www.vtk.org/
13. Malladi R, Sethian JA, Vermuri BC. Shape modeling with front propagation: a level set approach. IEEE Transactions on Pattern Analysis and Machine Intelligence 1995; 17(2):158-175.
14. Cebral JR, Löhner R. From medical images to anatomically accurate finite element grids. International Journal for Numerical Methods in Engineering 2001; 51:985-1008.
15. 1 surface interpolation. In Mathematical Software III, Rice Jr (ed.). Academic Press: New York, 1977; 161-194.
16. Löhner R. Regridding surface triangulations. Journal of Computational Physics 1996; 126:1-10.
17. Zhou T, Shimada K. An angle-based approach to two-dimensional mesh smoothing. Proceedings of the 9th International Meshing Roundtable, 2000; 373-384.
18. Taubin G. A signal processing approach to fair surface design. Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques, 1995; 351-358.
19. Garimella RV, Swartz BK. Curvature estimation for unstructured triangulations of surfaces. LA-UR-03-8240, Los Alamos National Laboratory, 2003.
20. Ito Y, Shih AM, Soni BK. Reliable isotropic tetrahedral mesh generation based on an advancing front method. Proceedings of the 13th International Meshing Roundtable, Williamsburg, VA, September 2004; 95-105.
21. Bonet J, Peraire J. An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems. International Journal for Numerical Methods in Engineering 1991; 31:1-17.