Skip to main content
SpringerLink
Log in

On Numerical Regularity of Trisection-Based Algorithms in 3D

  • Conference paper
  • First Online:
Differential and Difference Equations with Applications (ICDDEA 2015)

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 164))

  • 971 Accesses

Abstract

The longest-edge (LE-) trisection of the given tetrahedron is obtained by joining two equally spaced points on its longest edge with the opposite vertices, and, thus, splitting the tetrahedron into three sub-tetrahedra. On the base such LE-trisections we introduce and numerically test the refinement algorithms for tetrahedral meshes. Computations conducted show that the quality of meshes generated by these algorithms does not seem to degenerate.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Arnold, D.N., Mukherjee, A., Pouly, L.: Locally adapted tetrahedral meshes using bisection. SIAM J. Sci. Comput. 22 (2), 431–448 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baker, T.J.: Mesh generation: Art or science?. Prog. Aerosp. Sci. 41 (1), 29–63 (2005)

    Article  Google Scholar 

  3. Bansch, E.: Local mesh refinement in 2 and 3 dimensions. IMPACT Comput. Sci. Eng. 3 (3), 181–191 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  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, Singapore (1992)

    Chapter  Google Scholar 

  5. Brandts, J., Korotov, S., Křížek, M.: On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions. Comput. Math. Appl. 55, 2227–2233 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brandts, J., Korotov, S., Křížek, M.: On the equivalence of ball conditions for simplicial finite elements in R d. Appl. Math. Lett. 22, 1210–1212 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Carey, G.F.: Computational Grids: Generation, Refinement and Solution Strategies. Taylor and Francis, Washington (1997)

    MATH  Google Scholar 

  8. Dompierre, J., Vallet, M.-G., Labbé, P., Guibault, F.: An analysis of simplex shape measures for anisotropic meshes. Comput. Methods Appl. Mech. Eng. 194 (48–49), 4895–4914 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hannukainen, A., Korotov, S., Křížek, M.: On numerical regularity of the face-to-face longest-edge bisection algorithm for tetrahedral partitions. Sci. Comput. Program. 90, 34–41 (2014)

    Article  Google Scholar 

  10. Korotov, S., Křížek, M.: Red refinements of simplices into congruent subsimplices, Comput. Math. Appl. 67, 2199–2204 (2014)

    Article  MathSciNet  Google Scholar 

  11. Kossaczký, I.: A recursive approach to local mesh refinement in two and three dimensions. J. Comput. Appl. Math. 55 (3), 275–288 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. Křížek, M., Strouboulis, T.: How to generate local refinements of unstructured tetrahedral meshes satisfying a regularity ball condition. Numer. Methods Partial Differ. Equ. 13, 201–214 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  13. Korotov, S., Plaza, Á., Suárez, J.P.: Longest-edge n-section algorithms: properties and open problems. J. Comput. Appl. Math. 293, 139–146 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  14. Labbé, P., Dompierre, J., Vallet, M.-G., Guibault, F.: Verification of three-dimensional anisotropic adaptive processes. Int. J. Numer. Methods Eng. 88 (4), 350–369 (2011)

    Article  MATH  Google Scholar 

  15. Liu, A., Joe, B.: Relationship between tetrahedron shape measures. BIT 34 (2), 268–287 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  16. Liu, A., Joe, B.: Quality local refinement of tetrahedral meshes based on bisection. SIAM J. Sci. Comput. 16 (6), 1269–1291 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  17. Maubach, J.M.: Local bisection refinement for n-simplicial grids generated by reflection. SIAM J. Sci. Comput. 16 (1), 210–227 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  18. Padrón, M., Suárez, J., Plaza, A.: A comparative study between some bisection based partitions in 3D. Appl. Numer. Math. 55 (3), 357–367 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. Parthasarathy, V.N., Graichen, C.M., Hathaway, A.F.: A comparison of tetrahedron quality measures. Finite Elem. Anal. Des. 15 (3), 255–261 (1994)

    Article  Google Scholar 

  20. Plaza, A., Carey, G.F.: Local refinement of simplicial grids based on the skeleton. Appl. Numer. Math. 32 (2), 195–218 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  21. Plaza, A., Padrón, M.A., Carey, G.F.: A 3D refinement/derefinement algorithm for solving evolution problems. Appl. Numer. Math. 32 (4), 401–418 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  22. Plaza, A., Padrón, M.A., Suárez, J.P.: Non-degeneracy study of the 8-tetrahedra longest-edge partition. Appl. Numer. Math. 55 (4), 458–472 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  23. Plaza, A., Falcón, S., Suárez, J.P.: On the non-degeneracy property of the longest-edge trisection of triangles. Appl. Math. Comput. 216, 862–869 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  24. Plaza, A., Falcón, S., Suárez, J.P., Abad, P.: A local refinement algorithm for the longest-edge trisection of triangle meshes. Math. Comput. Simul. 82 (12), 2971–2981 (2012)

    Article  MathSciNet  Google Scholar 

  25. Rivara, M.-C., Levin, C.: A 3-D refinement algorithm suitable for adaptive and multi-grid techniques. Commun. Appl. Numer. Methods 8 (5), 281–290 (1992)

    Article  MATH  Google Scholar 

  26. Suárez, J.P., Abad, P., Plaza, A., Padrón, M.A.: Computational aspects of the refinement of 3D tetrahedral meshes. J. Comput. Methods Sci. Eng. 5, 1–10 (2005)

    MATH  Google Scholar 

  27. Whitehead, J.H.C.: On C 1-complexes. Ann. Math. 41 (4), 809–824 (1940)

    Article  MathSciNet  MATH  Google Scholar 

  28. Zhang, S.: Successive subdivisions of tetrahedra and multigrid methods on tetrahedral meshes. Houst. J. Math. 21, 541–556 (1995)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work has been partially supported by CYCIT Project MTM2008-05866-C03-02/MTM from Ministerio de Educación y Ciencia of Spain.

Author information

Authors and Affiliations

  1. Department of Computing, Mathematics and Physics, Bergen University College, Inndalsveien 28, 5020, Bergen, Norway

    Sergey Korotov

  2. Division of Mathematics, Graphics and Computation (MAGiC), IUMA, Information and Communication Systems, University of Las Palmas de Gran Canaria, Canary Islands, Las Palmas, Spain

    Ángel Plaza, José P. Suárez & Pilar Abad

Authors
  1. Sergey Korotov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ángel Plaza
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. José P. Suárez
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pilar Abad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergey Korotov .

Editor information

Editors and Affiliations

  1. Departamento de Ciências Exactas e Naturais, Academia Militar, Amadora, Portugal

    Sandra Pinelas

  2. Department of Mathematics and Statistics, Masaryk University, Brno, Czech Republic

    Zuzana Došlá

  3. Department of Mathematics and Statistics, Masaryk University, Brno, Czech Republic

    Ondřej Došlý

  4. School of Mathematics and Stastistics, Huazhong University of Science and Technology, Wuhan, China

    Peter E. Kloeden

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Korotov, S., Plaza, Á., Suárez, J.P., Abad, P. (2016). On Numerical Regularity of Trisection-Based Algorithms in 3D. In: Pinelas, S., Došlá, Z., Došlý, O., Kloeden, P. (eds) Differential and Difference Equations with Applications. ICDDEA 2015. Springer Proceedings in Mathematics & Statistics, vol 164. Springer, Cham. https://doi.org/10.1007/978-3-319-32857-7_35

Download citation

Publish with us

Policies and ethics

Search

Navigation