Automatic Mesh Generation Using the Symmetric Axis Transformation of Polygonal Domains

Proceedings of the IEEE

Volumn 80, Issue 9, 1992, Pages 1485-1501

  Srinivasan, Vijay ^a   Nackman, Lee R ^a   Tang, Jung Mu ^a   Meshkat, Siavash N ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE ELEMENT METHOD; GEOMETRY; ITERATIVE METHODS; TRIANGULATION;

AUTOMATIC MESH GENERATION; COMPUTATIONAL GEOMETRY; POLYGONAL DOMAINS; SLIVER PROCESSING; SYMMETRIC AXIS TRANSFORMATION;

IMAGE PROCESSING;

EID: 0026923074     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.163413     Document Type: Article

References (41)

1. O. C. Zienkiewicz and R. L. Taylor. The Finite Element Method, vol. 1. London, U.K.:McGraw-Hill, 1989.
2. K. Ho-Le, “Finite element mesh generation methods: A review and classification,” Computer-Aided Design, vol. 20, no. 1, pp. 27–38, Jan./Feb. 1988.
3. N. Sapidis and R. Perucchio, “Advanced techniques for automatic finite element meshing from solid models,” Computer-Aided Design, vol. 21, no. 4, pp. 248–253, May 1989.
4. M. Bern and D. Eppstein “Mesh generation and optimal triangulation,” in Computing in Euclidean Geometry, F. K. Hwang and D-Z. Du, Eds. World Scientific, 1992.
5. O. C. Zienkiewicz and D. V. Phillips, “An automatic mesh generation scheme for plane and curved surfaces by ‘isoparametric’ coordinates,” Int. J. Numer.Meth. Eng., vol. 3, pp. 519–528, 1971.
6. W. J. Gordon and C. A. Hall, “Construction of curvilinear coordinate systems and applications to mesh generation, Int. J. Numer.Meth. Eng., vol. 7, pp. 461–477, 1973.
7. W. A. Cook, “Body oriented (natural) coordinates for generating three-dimensional meshes,” Int. J. Numer.Meth. Eng., vol. 8, pp. 27–43, 1974.
8. A. Bykat, “Automatic generation of triangular grid: I-Subdivision of a general polygon into convex subregions. II-Triangulation of convex pplygons,” Int. J. Numer.Meth. Eng., vol. 10, pp. 1329–1342, 1976.
9. E. A. Sadek, “A scheme for the automatic generation triangular finite elements,” Int. J. Numer.Meth. Eng., vol. 15, pp. 1813–1822, 1980.
10. B. Joe and R. B. Simpson, “Triangular meshes for regions of complicated shape,” Int. J. Numer.Meth. Eng., vol. 23, pp. 751–778, 1986.
11. B. Wordenweber, “Finite element mesh generation,” Computer-Aided Design, vol. 16, no. 5, pp. 285–291, Sept. 1984.
12. T. C. Woo and T. Thomasma, “An algorithm for generating solid elements in objects with holes,” Computers and Structures, vol. 18, no. 2, pp. 333–342, 1984.
13. M. L. C. Sluiter and D. C. Hansen, “A general purpose automatic mesh generator for shell and solid finite elements,” in Computers in Engineering (Book No. G00217), L. E. Hulbert, Ed., vol. 3. ASME, 1982, pp. 29–34.
14. M. A. Yerry and M. S. Shephard, “A modified quadtree approach to finite element mesh generation,” IEEE Computer Graphics and Applications, vol. 3, no. 1, pp. 39-46, 1983.
15. P. L. Baehmann, S. L. Wittchen, M. S. Shephard, K. R. Grice, and M. A. Yerry, “Robust, geometrically based, automatic two-dimensional mesh generation,” Int. J. Numer.Meth. Eng., vol. 24, pp. 1043–1078, 1987.
16. A. Kela, R. Perucchio, and H. B. Voelcker, “Toward automatic finite element analysis,” Computers in Mechanical Engineering, vol. 5, no. 1, pp. 57–71, July 1986.
17. R. Perucchio, M. Saxena, and A. Kela, “Automatic mesh generation from solid models based on recursive spatial decompositions,” Int. J. Numer.Meth. Eng., vol. 28, pp. 2469–2501, 1989.
18. B. S. Baker, E. Grosse, and C. S. Rafferty, “Nonobtuse triangulation of polygons,” Discrete and Computational Geometry, vol. 3, pp. 147–168, 1988.
19. L. P. Chew, “Guaranteed-quality triangular meshes,” Tech. Rep. TR-89-983, Cornell University, 1989.
20. M. Bern, D. Eppstein, and J. R. Gilbert, “Provably good mesh generation,” in Proc. 31st IEEE Symp. Foundations of Computer Science, 1990, pp. 231–241.
21. E. Melissaratos and D. Souvaine, “Coping with inconsistencies: A new approach to produce quality triangulations of polygonal domains with holes for the finite element method,” Tech. Rep, LCSR-TR-163, Department of Computer Science, Rutgers University, 1991.
22. M. Bern and D. Eppstein, “Polynomial-size nonobtuse triangulation of polygons,” in Proc. 7th ACM Symp. Computational Geometry, 1991, pp. 342–350.
23. L. De Floriani, B. Falcidieno, and C. Pienovi, “Delaunay-based representation of surfaces defined over arbitrarily shaped domains,” Computer Vision, Graphics, and Image Processing, vol. 32, pp. 127–140, 1985.
24. D. T. Lee and A. K. Lin, “Generalized Delaunay triangulation for planar graphs,” Discrete and Computational Geometry, vol. 1, pp. 201–217, 1986.
25. L. P. Chew, “Constrained Delaunay triangulations,” Algorithmica, vol. 4, no. 1, pp. 97–108, 1989.
26. J. C. Cavendish, “Automatic triangulation of arbitrary planar domains for the finite element method,” Int. J. Numer.Meth. Eng., vol, 8, pp. 679–696, 1974.
27. Z. J. Cendes, D. Shenton, and H. Shahnasser, “Magnetic computation using Delaunay triangulation and complementary finite element methods,” IEEE Trans.Magn., vol. 19, no. 6, 1983.
28. M. S. Shephard, “Finite element modeling within an integrated geometric modeling environment: Part I - Mesh generation,” Engineering with Computers, vol. 1, no. 2, pp. 61–71, 1985.
29. W. H. Frey. “Selective refinement: A new strategy for automatic node placement in graded triangular meshes,” Int. J. Numer.Meth. Eng., vol. 24, pp. 2183–2200, 1987.
30. D. T. Lee, “Medial axis transformation of a planar shape,” IEEE Trans. Patt. Anal. Mach. Intell., vol. 4, pp. 363–369, July 1982.
31. V. Srinivasan and L. R. Nackman, “Voronoi diagram for multiply-connected polygonal domains I: Algorithm,” IBM J. Res. Develop., vol. 31, no. 3, pp. 361–372, May 1987.
32. H. Blum and R. N. Nagel, “Shape description using weighted symmetric axis features,” Pattern Recognition, vol. 10, no. 3, pp. 167–180, 1978.
33. L. R. Nackman and V. Srinivasan, “Method of generating finite elements using the symmetric axis transform,” U.S. Patent 4797842, Jan. 10, 1989.
34. H. N. Gursoy, “Shape interrogation by medial axis transform for automated analysis,” Ph.D. thesis, MIT, Nov. 1989.
35. D. T. Lee and R. L. Drysdale III, “Generalization of Voronoi diagrams in the plane,” SIAM J. Computing, vol. 10, no. 1, pp. 73–87, Feb. 1981.
36. D. Leven and M. Sharir, “Intersection and proximity problems and Voronoi diagrams,” Algorithmic and Geometric Aspects of Robotics, pp. 187–228, 1987.
37. F. P. Preparata and M. I. Shamos, Introduction. New York: Springer-Verlag, 1985.
38. D. E. Beskos, Boundary Element Methods in Mechanics. Amsterdam: North-Holland, 1987.
39. W. H. Frey and D. A. Field, “Mesh relaxation: A new technique for improving triangulations,” Int. J. Numer. Meth. Eng., vol. 31, pp. 1121–1133, 1991.
40. N. Dyn, D. Levin, and S. Rippa, “Data dependent triangulations for piecewise linear interpolation,” IMA J. Numer. Anal., vol. 10, no. 1, pp. 137–154, Jan. 1990.
41. E. Quak and L. L. Schumaker, “Cubic spline fitting using data dependent triangulations, Computer-Aided Geometric Design, vol. 7, pp. 293–301, 1990.