Unstructured grid generation and a simple triangulation algorithm for arbitrary 2-D geometries using object oriented programming

International Journal for Numerical Methods in Engineering

Volumn 40, Issue 2, 1997, Pages 251-268

  Karamete, B K ^a   Tokdemir, T ^a   Ger, M ^a  

^a MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Object oriented programming; Triangulation; Unstructured grid

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; GEOMETRY; OBJECT ORIENTED PROGRAMMING; TREES (MATHEMATICS);

MESH GENERATION;

TRIANGULATION;

EID: 0030787266     PISSN: 00295981     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0207(19970130)40:2<251::AID-NME62>3.0.CO;2-U     Document Type: Article

References (20)

1. P. Green and R. Sibson, 'Computing dirichlet tesselations in the plane', Comp. J., 21(2), 168 -173 (1978).
2. D. H. Mclain, 'Two dimensional interpolation from random data', Comp. J., 19(2), 178-181 (1976).
3. R. Sibson, 'Locally equiangular triangulations', Comp. J., 21(3), 243-245 (1978).
4. D. F. Watson, 'Computing the n-dimensional Delaunay tesselation with application of Voronoi polytopes', Comp. J., 24(2), 167-172 (1981).
5. A. Bowyer, 'Computing Dirichlet tesselations', Comp. J., 24(2), 162-166 (1981).
6. J. P. Peraire, et al., 'Unstructured Mesh Generation Methods for CFD', Von Karman Ins. Lecture Series 1990-06, 1990.
7. N. Kikuchi, 'Adaptive grid design methods for FEA', Comput. Meths. Appl. Mech. Eng., 55, 129-160 (1986).
8. N. P. Weatherill, 'Grid Generation', Von Karman Ins. Lecture Series 1990-06, 1990.
9. J. Bonet and J. Peraire, 'An alternating digital tree (ADT) algorithm for geometric searching and intersection problem', Int.j. numer. methods eng., 31, 1- 17 (1991).
10. S. H. Lo, 'Delaunay Triangulation of non-convex planer domains', Int. j. numer. methods eng., 28, 2695-2707 (1989).
11. J. Fukuda and J. Suhara, 'Automatic mesh generation for FEA', Prof. Int. Conf. on FEM, Beijing, China, (1982), pp. 931-937.
12. J. C. Cavendish, 'Automatic triangulation of arbitrary planar domains for the FEM', Int.j. numer. methods eng., 8, 679 696 (1974).
13. S. H. Lo, 'A new mesh generation scheme for arbitrary planar domains', Int. j. numer. methods eng., 21, 1403-1426 (1985).
14. M. Suzuki, 'Surface grid generation'. Int. j. numer. methods fluids, 17, 163-176 (1993).
15. O. C. Zienkiewicz and D. V. Phillips, 'An automatic mesh generation scheme for plane and curved surfaces by isoparametric co-ordinates', Int.j. numer. methods eng., 3, 519-528 (1971).
16. Borland International, Turbo Pascal: Turbo Vision Guide, Borland International, CA, USA, 1990.
17. W. H. Frey, 'Selective refinement: A new strategy for automatic node placement in graded triangular meshes', Int.j. numer. methods eng., 24, 2183-2200 (1987).
18. S. Ø. Wille, 'A structured tri-tree search method for generation of optimal unstructured finite element grids in two and three dimensions', Int.j. numer. methods fluids, 14, 861-881 (1992).
19. G. Subramanian, V. V. S. Raveendra and M. G. Kamath, 'Robust boundary triangulization and Delaunay triangulation of arbitrary planar domains', Int.j. numer. methods eng., 37, 1779-1789 (1994).
20. N. P. Weatherill and O. Hassan, 'Efficient three dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints', Int. j. numer. methods eng., 37, 2005-2039 (1994).