Skip to main content
Log in

The Cut&Glue mesh generation algorithm

  • Published:
Engineering with Computers Aims and scope Submit manuscript

Abstract

This paper describes a technique for generating quadrilateral finite element meshes on convex, four-sided patches, given an arbitrary number of elements along each side of the patch. The technique first generates a subdivision with the correct topological structure and smoothes the subdivision to obtain elements of acceptance shape for finite element analysis. The correct mesh topology is obtained from a regular subdivision by cutting rectangular corners of appropriate size and interconnecting the sides introduced by the cuts.

The method can also be applied on three-dimensional patches producing meshes of brick elements with gradations in all directions.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Herrmann, L.R. (1976) Laplacian-isoparametric grid generation scheme. J. Eng. Mech. Div. Proc. ASCE 102(EM5), October, pp 749–756

    Google Scholar 

  2. Shephard, Mark S. (1988) Approaches to the automatic generation and control of finite element meshed. Appl. Mech. Rev. 41(4), April, pp 169–185

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Høyte, J. The Cut&Glue mesh generation algorithm. Engineering with Computers 8, 51–58 (1992). https://doi.org/10.1007/BF01206336

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01206336

Keywords

Navigation