A Comparison of Algorithms for the Triangulation Refinement Problem

  • María-Cecilia Rivara
  • Patricio Inostroza


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.


Delaunay Triangulation Boundary Side Longe Side Local Refinement Refinement Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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
  2. 2.
    S.W. Bova and G.F. Carey, “Mesh generation/refinement using fractal concepts and iterated function systems”, Int. Journal for Numer. Meth. in Engrg., vol. 33, 287–305, (1992).MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    L. De Floriani, “Surface representations based on triangular grids”, The Visual Computer, 27-48 (1987).Google Scholar
  4. 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. 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
  6. 6.
    F.P. Preparata and M.I. Shamos, “Computational Geometry. An Introduction”, Springer-Verlag, New York (1985).CrossRefGoogle Scholar
  7. 7.
    M.C. Rivara, “Design and data structure of fully adaptive multigrid, finite-element software”, ACM Transactions on Mathematical Software, 10, 242–264 (1984).MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    M.C. Rivara, “Algorithms for refining triangular grids suitable for adaptive and multigrid techniques”, Int. J. for Numerical Methods in Engrg., 20, 745–756 (1984).MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    M.C. Rivara, “A grid generator based on 4 triangles conforming mesh-refinement algorithms for triangulations”, International Journal for Numerical Methods in Engineering, 24, 1343–1354 (1987).zbMATHCrossRefGoogle Scholar
  10. 10.
    M.C. Rivara, “Local modification of meshes for adaptive and/or multigrid finite element methods”, Journal of Computational and Applied Mathematics 36, 79–89, (1991)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    M.C. Rivara, “A discussion on the triangulation refinement problem”, Proceedings Fifth Canadian Conference on Computational Geometry, 42-47 (1993).Google Scholar

Copyright information

© Springer Science+Business Media New York 1994

Authors and Affiliations

  • María-Cecilia Rivara
    • 1
  • Patricio Inostroza
    • 1
  1. 1.Department of Computer ScienceUniversity of ChileSantiagoChile

Personalised recommendations