Skip to main content
SpringerLink
Log in

Parallel decoupled terminal-edge bisection method for 3D mesh generation

  • Original Article
  • Published:
Engineering with Computers Aims and scope Submit manuscript

Abstract

We present a practical and stable algorithm for the parallel refinement of tetrahedral meshes. The algorithm is based on the refinement of terminal-edges and associated terminal stars. A terminal-edge is a special edge in the mesh which is the longest edge of every element that shares such an edge, while the elements that share a terminal-edge form a terminal star. We prove that the algorithm is inherently decoupled and thus scalable. Our experimental data show that we have a stable implementation able to deal with hundreds of millions of tetrahedra and whose speed is in between one and two order of magnitude higher from the method and implementation we presented (Rivara et al., Proceedings 13th international meshing roundtable, 2004).

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Barker K, Chernikov A (2004) Nikos Chrisochoides, and Keshav Pingali. A load balancing framework for adaptive and asynchronous applications. Trans Parallel Distrib Syst 15(2):183–192

    Article  Google Scholar 

  2. Blelloch G, Hardwick J, Miller G, Talmor D (1999) Design and implementation of a practical parallel delaunay algorithm. Algorithmica 24:243–269

    Article  MATH  MathSciNet  Google Scholar 

  3. Nave D, Chrisochoides N, Chew LP (2004) Guaranteed-quality parallel delaunay refinement for restricted polyhedral domains. Comput Geom: Theor Appl 28(2–3):191–215

    MATH  MathSciNet  Google Scholar 

  4. Chew LP, Chrisochoides N, Sukup F (1997) Parallel constrained Delaunay meshing. In: ASME/ASCE/SES summer meeting, special symposium on trends in unstructured mesh generation, pp 89–96, Northwestern University, Evanston, IL, 1997

  5. Chrisochoides N (2006) Numerical solution of partial differential equations on parallel computers, volume in print. Chapter A survey of parallel mesh generation methods. Springer, Berlin Heidelberg New York

  6. Chrisochoides N, Houstis E, Rice J (1994) Mapping algorithms and software environment for data parallel PDE iterative solvers. J Parallel Distrib Comput 21(1):75–95

    Article  Google Scholar 

  7. Chrisochoides N, Nave D (2000) Simultaneous mesh generation and partitioning. Math Comput Simulation 54(4–5):321–339

    Article  MATH  MathSciNet  Google Scholar 

  8. Chrisochoides N, Nave D (2003) Parallel Delaunay mesh generation kernel. Int J Numer Meth Eng 58:161–176

    Article  MATH  Google Scholar 

  9. Chrisochoides NP (1996) Multithreaded model for load balancing parallel adaptive computations. Appl Numer Math 6:1–17

    Google Scholar 

  10. de Cougny H, Shephard M (1999) Parallel volume meshing using face removals and hierarchical repartitioning. Comp Meth Appl Mech Eng

  11. Galtier J, George PL (1997) Prepartitioning as a way to mesh subdomains in parallel. In: Special symposium on trends in unstructured mesh generation. ASME/ASCE/SES

  12. Gutierrez F (2003) The longest edge bisection of regular tetrahedron. In: Personal communication

  13. Hitschfeld N, Rivara MC (2002) Automatic construction of non-obtuse boundary and/or interface delaunay triangulations for control volume methods. Int J Numer Meth Eng 55:803–816

    Article  MATH  Google Scholar 

  14. Hitschfeld N, Villablanca L, Krause J, Rivara MC (2003) Improving the quality of meshes for the simulation of semiconductor devices using lepp-based algorithms. Int J Numer Meth Eng 58:333–347

    Article  MATH  Google Scholar 

  15. Ito Y (2004) Advance front mesh generator. Unpbulished Software, March

  16. Jones MT, Plassmann PE (1994) Parallel algorithms for the adaptive refinement and partitioning of unstructured meshes. In: Proceedings of the scalable high-performance computing conference

  17. Kot A, Chrisochoides N (2004) “green” multi-layered “smart” memory management system. Int Sci J Comput 2(3):91–97

    Google Scholar 

  18. Linardakis L, Chrisochoides N (2006) Delaunay decoupling method for parallel guaranteed quality planar mesh generation. SISC 27(4): 1394–1423

    MATH  MathSciNet  Google Scholar 

  19. Lohner R, Cebral J (1999) Parallel advancing front grid generation. In: International meshing roundtable. Sandia National Labs

  20. Rivara MC (1984) Design and data structure of fully adaptive multigrid, finite element software. ACM Trans Math Softw 10:242–264

    Article  MATH  MathSciNet  Google Scholar 

  21. Muthukrishnan SN, Shiakolos PS, Nambiar RV, Lawrence KL (1995) Simple algorithm for adaptative refinement of three-dimensionalfinite element tetrahedral meshes. AIAA J 33:928–932

    Article  MATH  Google Scholar 

  22. Nambiar N, Valera R, Lawrence KL, Morgan RB, Amil D (1993) An algorithm for adaptive refinement of triangular finite element meshes. Int J Numer Meth Eng 36:499–509

    Article  MATH  Google Scholar 

  23. Nave D, Chrisochoides N, Chew LP (2002) Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains. In: Proceedings of the eighteenth annual symposium on computational geometry, pp 135–144

  24. José G. Castaños, John E. Savage (1997) The dynamic adaptation of parallel mesh-based computation. In: SIAM 7th symposium on parallel and scientific computation 1997

  25. José G. Castaños, John E. Savage (1999) Pared: a framework for the adaptive solution of pdes. In: 8th IEEE symposium on high performance distributed computing

  26. Okusanya T, Peraire J (1997) 3D parallel unstructured mesh generation. In: Trends in unstructured mesh generation, pp 109–116

  27. Rivara MC (1984) Algorithms for refining triangular grids suitable for adaptive and multigrid techniques. Int J Numer Meth Eng 20:745–756

    Article  MATH  MathSciNet  Google Scholar 

  28. Rivara MC (1989) Selective refinement/derefinement algorithms for sequences of nested triangulations. Int J Numer Meth Eng 28:2889–2906

    Article  MATH  MathSciNet  Google Scholar 

  29. Rivara MC (1997) New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations. Int J Numer Meth Eng 40:3313–3324

    Article  MATH  MathSciNet  Google Scholar 

  30. Rivara MC, Hitschfeld N, Simpson RB (2001) Terminal edges Delaunay (small angle based) algorithm for the quality triangulation problem. Comput-Aided Des 33:263–277

    Article  Google Scholar 

  31. Rivara MC, Levin C (1992) A 3D refinement algorithm for adaptive and multigrid techniques. Commun Appl Numer Meth 8:281–290

    Article  MATH  Google Scholar 

  32. Rivara MC, Palma M (1997) New lepp algorithms for quality polygon and volume triangulation: implementation issues and practical behavior. In: Cannan SA, Saigal AMD (eds) Trends unstructured mesh generationi, Vol. 220, pp 1–8

  33. Rivara MC, Pizarro D, Chrisochoides N (2004) Parallel refinement of tetrahedral meshes using terminal-edge bisection algorithm. In: Proceedings 13th international meshing roundtable, Williamsburg, Virginia, pp 427–436

  34. Said R, Weatherill N, Morgan K, Verhoeven N (1999) Distributed parallel delaunay mesh generation. Comp Meth Appl Mech Eng 177:109–125

    Article  MATH  Google Scholar 

  35. Simpson RB, Hitschfeld N, Rivara MC (2001) Approximate quality mesh generation. Eng Comput 17:287–298

    Article  MATH  Google Scholar 

  36. Spielman DA, Teng S-H, Üngör A (2001) Parallel Delaunay refinement: algorithms and analyses. In: Proceedings of the eleventh international meshing roundtable, pp 205–217

  37. Williams R (1991) Adaptive parallel meshes with complex geometry. Numerical grid generation in computational fluid dynamics and related fields

Download references

Acknowledgments

The C++ code RemGO3D was developed at the University of Chile under grant Fondecyt 1040713. The parallel results were obtained by using computational facilities at the College of William and Mary which were enabled by grants from Sun Microsystems, the National Science Foundation, and Virginia’s Commonwealth Technology Research Fund. We thank the referees whose comments helped to improve the paper and Daniel Pizarro who wrote the previous Java implementation.

Author information

Authors and Affiliations

  1. Universidad de Chile, Santiago, Chile

    Maria-Cecilia Rivara & Carlo Calderon

  2. College of William and Mary, Williamsburg, VA, USA

    Andriy Fedorov & Nikos Chrisochoides

Authors
  1. Maria-Cecilia Rivara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlo Calderon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andriy Fedorov
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nikos Chrisochoides
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maria-Cecilia Rivara.

Additional information

Maria-Cecilia Rivara and Carlo Calderon's work was partially supported by Fondecyt 1040713.

Andriy Fedorov’s work is supported in part by ITR #ACI-0085969, and NGS #ANI-0203974.

Nikos Chrisochoides’s work is supported in part by NSF Career Award #CCR-0049086, ITR #ACI-0085969, NGS #ANI-0203974, and ITR #CNS-0312980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rivara, MC., Calderon, C., Fedorov, A. et al. Parallel decoupled terminal-edge bisection method for 3D mesh generation. Engineering with Computers 22, 111–119 (2006). https://doi.org/10.1007/s00366-006-0013-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00366-006-0013-2

Keywords

Search

Navigation