Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M., Bern, D. Dobkin and D. Eppstein, “Triangulating polygons without large angles”, Proc. 8th annual Symp. on Computational Geometry, 222-231, (1992)
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).
L. De Floriani, “Surface representations based on triangular grids”, The Visual Computer, 27-48 (1987).
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).
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).
F.P. Preparata and M.I. Shamos, “Computational Geometry. An Introduction”, Springer-Verlag, New York (1985).
M.C. Rivara, “Design and data structure of fully adaptive multigrid, finite-element software”, ACM Transactions on Mathematical Software, 10, 242–264 (1984).
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).
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).
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)
M.C. Rivara, “A discussion on the triangulation refinement problem”, Proceedings Fifth Canadian Conference on Computational Geometry, 42-47 (1993).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Rivara, MC., Inostroza, P. (1994). A Comparison of Algorithms for the Triangulation Refinement Problem. In: Baeza-Yates, R. (eds) Computer Science 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-9805-0_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-9805-0_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-9807-4
Online ISBN: 978-1-4757-9805-0
eBook Packages: Springer Book Archive