A Comparison of Algorithms for the Triangulation Refinement Problem
The triangulation refinement problem has become an important issue in engineering applications. It can be formulated in general terms as follows: given a valid, non-degenerate triangulation, construct a locally refined triangulation, such that the smallest (or the largest) angle is bounded. Two algorithms to solve this problem are considered: a Delaunay refinement algorithm and Rivara refinement algorithm based on the longest side bisection of triangles. The cost of these algorithms, their properties and geometrical characteristics are discussed. Several test problems to compare the practical behavior of these algorithms are also included.
KeywordsDelaunay Triangulation Boundary Side Longe Side Local Refinement Refinement Algorithm
Unable to display preview. Download preview PDF.
- 1.M., Bern, D. Dobkin and D. Eppstein, “Triangulating polygons without large angles”, Proc. 8th annual Symp. on Computational Geometry, 222-231, (1992)Google Scholar
- 3.L. De Floriani, “Surface representations based on triangular grids”, The Visual Computer, 27-48 (1987).Google Scholar
- 4.P. Inostroza and M.C. Rivara, “Herramienta gráfica interactiva para generar triangulaciones en 2D”, Numerical Methods in Engineering and Applied Sciences, H. Alder, J.C. Heinrich, S. Lavanchy, E. Oñate and B. Suarez, CIMNE, Barcelona, pp. 533–538 (1992).Google Scholar
- 5.G. Iribarren and M.C. Rivara, “A study on the classes of similar triangles produced by 4T-bisection”, Dept. of Computer Science, University of Chile (1992).Google Scholar
- 11.M.C. Rivara, “A discussion on the triangulation refinement problem”, Proceedings Fifth Canadian Conference on Computational Geometry, 42-47 (1993).Google Scholar