A Study on Size-Optimal Longest Edge Refinement Algorithms

Conference paper

Abstract

Mesh generation and refinement are widely used in applications that require a decomposition of geometric objects for processing. Longest edge refinement algorithms seek to obtain a better decomposition over selected regions of the mesh by the division of its elements. Until now, these algorithms did not provide theoretical guarantees on the size of the triangulation obtained. In this paper we present a study of the computational cost of longest edge bisection algorithms for 2-dimensional mesh refinement and our developments in the theoretical analysis of such algorithms.

Keywords

Computational Geometry Mesh Generation Unstructured Mesh Longe Edge Small Edge 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baker, B.S., Grosse, E., Rafferty, C.S.: Nonobtuse triangulation of polygons. Discrete & Computational Geometry 3, 147–168 (1988)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Baker, T.: Automatic mesh generation for complex three-dimensional regions using a constrained delaunay triangulation. Engineering with Computers 5, 161–175 (1989), doi:10.1007/BF02274210CrossRefGoogle Scholar
  3. 3.
    Bern, M., Eppstein, D., Gilbert, J.: Provably good mesh generation. Journal of Computer and System Sciences 48(3), 384–409 (1994)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Bern, M.W., Eppstein, D.: Mesh generation and optimal triangulation. In: Du, D.-Z., Hwang, F.K.-M. (eds.) Computing in Euclidean Geometry. Lecture Notes Series on Computing, vol. 1, pp. 23–90. World Scientific (1992)Google Scholar
  5. 5.
    Borouchaki, H., George, P.L.: Aspects of 2-d delaunay mesh generation. International Journal for Numerical Methods in Engineering 40(11), 1957–1975 (1997)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Chew, L.P.: Constrained delaunay triangulations. In: Proceedings of the Third Annual Symposium on Computational Geometry, SCG 1987, pp. 215–222. ACM, New York (1987)CrossRefGoogle Scholar
  7. 7.
    Edelsbrunner, H.: Triangulations and meshes in computational geometry. Acta Numerica 9, 133–213 (2000)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Gutierrez, C., Gutierrez, F., Rivara, M.-C.: Complexity of the bisection method. Theoretical Computer Science 382(2), 131–138 (2007)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Jones, M.T., Plassman, P.E.: Computational results for parallel unstructured mesh computations. Technical report, Knoxville, TN, USA (1994)Google Scholar
  10. 10.
    Jones, M.T., Plassmann, P.E.: Adaptive refinement of unstructured finite-element meshes. Finite Elements in Analysis and Design 25(1-2), 41–60 (1997)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Melissaratos, E.A., Souvaine, D.L.: Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes. In: Proceedings of the Eighth Annual Symposium on Computational Geometry, SCG 1992, pp. 202–211. ACM, New York (1992)CrossRefGoogle Scholar
  12. 12.
    Muthukrishnan, S.N., Shiakolas, P.S., Nambiar, R.V., Lawrence, K.L.: Simple algorithm for the adaptive refinement of three dimensional problems with tetrahedral meshes. AIAA Journal 33(5), 928–932 (1995)MATHCrossRefGoogle Scholar
  13. 13.
    Nambiar, R.V., Valera, R.S., Lawrence, K.L., Morgan, R.B., Amil, D.: An algorithm for adaptive refinement of triangular element meshes. International Journal for Numerical Methods in Engineering 36(3), 499–509 (1993)MATHCrossRefGoogle Scholar
  14. 14.
    Rivara, M.-C.: Algorithms for refining triangular grids suitable for adaptive and multigrid techniques. International Journal for Numerical Methods in Engineering 20(4), 745–756 (1984)MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Rivara, M.-C.: Design and data structure of fully adaptive, multigrid, finite-element software. ACM Transactions on Mathematical Software 10(3), 242–264 (1984)MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    Rivara, M.-C.: New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations. International Journal for Numerical Methods in Engineering 40(18), 3313–3324 (1997)MathSciNetMATHCrossRefGoogle Scholar
  17. 17.
    Rivara, M.-C.: Lepp-bisection algorithms, applications and mathematical properties. Applied Numerical Mathematics 59(9), 2218–2235 (2009)MathSciNetMATHCrossRefGoogle Scholar
  18. 18.
    Rivara, M.-C., Rodriguez, P., Montenegro, R., Jorquera, G.: Multithread parallelization of lepp-bisection algorithms. Applied Numerical Mathematics 62(4), 473–488 (2012)MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Ruppert, J.: A delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms 18(3), 548–585 (1995)MathSciNetMATHCrossRefGoogle Scholar
  20. 20.
    Schneiders, R.: Quadrilateral and Hexahedral Element Meshes. In: Thompson, J., Soni, B., Weatherill, N. (eds.) Handbook of Grid Generation. CRC Press (1999)Google Scholar
  21. 21.
    Shewchuk, J.R.: Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications 22(1-3), 21–74 (2002)MathSciNetMATHCrossRefGoogle Scholar
  22. 22.
    Shewchuk, J.R.: Unstructured mesh generation. In: Naumann, U., Schenk, O. (eds.) Combinatorial Scientific Computing, ch. 10, pp. 259–298. CRC Press (2011)Google Scholar
  23. 23.
    Suárez, J.P., Plaza, A., Carey, G.F.: The propagation problem in longest-edge refinement. Finite Elements in Analysis and Design 42(2), 130–151 (2005)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of ChileSantiagoChile

Personalised recommendations