Pages Navigation Menu
Submit scientific paper, scientific publications, International Research Journal | Meždunarodnyj naučno-issledovatel’skij žurnal

ISSN 2227-6017 (ONLINE), ISSN 2303-9868 (PRINT), DOI: 10.18454/IRJ.2227-6017
ЭЛ № ФС 77 - 80772, 16+

Download PDF ( ) Pages: 5-7 Issue: № 9 (28) () Search in Google Scholar


Copy the reference manually or choose one of the links to import the data to Bibliography manager
Berzin D.V., "FINITE ELEMENT MESH AUTOMATIC GENERATION USING TRIANGULAR SUBDIVISION SCHEMES". Meždunarodnyj naučno-issledovatel’skij žurnal (International Research Journal) № 9 (28), (2020): 5. Tue. 12. May. 2020.
Berzin D. V. FINITE ELEMENT MESH AUTOMATIC GENERATION USING TRIANGULAR SUBDIVISION SCHEMES / D. V. Berzin // Mezhdunarodnyj nauchno-issledovatel'skij zhurnal. — 2020. — № 9 (28). — С. 5—7.



Берзин Д.В.

Кандидат физико-математических наук, доцент, Финансовый университет при Правительстве Российской Федерации, Москва



В работе предложен новый алгоритм для построения треугольной сети для поверхности NURBS, заданной посредством контрольных точек. При этом используются две техники подразбиений –  Modified Butterfly и Loop.

Ключевые слова: NURBS, контрольные точки, система автоматизированного проектирования, треугольная сеть, подразбиения.

Berzin D.V.

PhD,  Associate Professor, Financial University under the Government of the Russian Federation, Moscow



We suggest here a new algorithm for triangular finite element mesh generation for NURBS surface represented as a set of control points. We use a modern approach – subdivision techniques, which has many advantages. Two different subdivision schemes are presented here: Modified Butterfly and Loop ones.

Keywords: NURBS, control points, CAD system, FE mesh, subdivision.

  1. The problem to solve

Suppose we are given a 2-dimensional surface S, defined by means of control points, for example, by data stored in IGES file type 126 [1]. Thus, we have a set of control points 12-05-2020 11-01-05, weights 12-05-2020 11-01-16, knot sequence 12-05-2020 11-02-47, where i= -1, … , L+1; j=-1, … , M+1; n=0, …, L; k=0, … , M. And the corresponding NURBS surface has the following parametric form:

12-05-2020 11-03-58

where 12-05-2020 11-04-48 are B-spline functions ([2], Ch.10,17).

Triangular patches in CAD system development have certain advantages over quadrilateral ones ([2], Ch.24). For example, they do not suffer from some kinds of degeneracies and are thus better suited to describe complex geometries than are rectangular patches.

Our task is to construct a triangular finite element mesh satisfying the conditions ([3], [4], [5]):

Triangles should satisfy an aspect ratio, i.e. they must be close to regular triangles. Nodes of triangles must lie exactly on the given surface S. The distance d  between triangle and surface should be less than number ε, chosen by a user. User should be able to change the mesh adaptively (e.g., density of the mesh in some areas, the number ε, and so on).

  1. Solution of the problem

Without loss of generality, consider a bicubic B-spline surface S.

Step 1. Bringing a bicubic B-spline surface into a piecewise bicubic Bezier form. This is a standard CAGD procedure ([2], Ch.17), and can be realized by a subroutine, say, “Bezier”. Suppose, now we are given a rectangular net of points 12-05-2020 11-13-08. All of them lie on S . Consider a planar rectangular domain R, spanned on points 12-05-2020 11-13-52, that there is a homeomorphism

12-05-2020 11-14-14

Remark. In general case there is a polyhedron K  instead of rectangle 12-05-2020 11-14-33 ([5], Ch.3).

Step 2. To construct an initial mesh, we pick out points from the set 12-05-2020 11-20-52. We want the initial mesh to be close to the aspect ratio demand. The subroutine, say, “Initial” uses diagonal transpose technique (e.g., see [4]): it starts from the rectangle 12-05-2020 11-21-07, compares 12-05-2020 11-21-33, and chooses the shortest diagonal to divide a quadrilateral into 2 triangles. My colleague Nikita Kojekine (see also [8] and [9]) wrote a computer program in C++ to get the results.  The program divides each quadrilateral in the same way.

Subdivision process

Step 3a. For a subdivision process, we suggest an interpolating Modified Butterfly scheme ([6], Ch.4). We can suppose here that, loosely speaking, the subdivision surfaces 12-05-2020 11-21-57 approach to a given surface S. Here 12-05-2020 11-22-14, and f (R)  is the subdivision surface. After k-th step of subdivision, we obtain a triangular net 12-05-2020 11-22-47, and a corresponding mesh 12-05-2020 11-22-54, where

12-05-2020 11-23-10

A user can interactively choose a level of subdivision in different domains. Let the subroutine be called “Subdivision”.

Step 3b. Instead of Modified Butterfly scheme, sometimes it is advantageous to use other triangular schemes. One of most popular of them is (approximating) Loop scheme ([6], Ch.4). The explanation and results for the step 3 follows:

Program “Subdivision”. The program “subdivision surfaces” was created to demonstrate two different triangular subdivision schemes. One is interpolating Modified-Butterfly scheme, second is Loop scheme. The program was written in Microsoft Visual C++ using MFC (Microsoft Foundation Classes) technology, OpenGL and VTK (free-source visualization toolkit) by my colleague Nikita Kojekine. Program reads initial mesh files first. The very simple format was developed for them.

For example:

12-05-2020 11-33-55

Fig. 1 – Tetrahedron interpolated using Modified Butterfly Scheme, after 6 steps subdivisions

12-05-2020 11-34-02

Fig. 2 – Same tetrahedron approximated using Loop scheme, after 6 steps of subdivision

The program is provided with more complex examples of meshes. For example, the ‘rose’ initial mesh and after subdivision:

12-05-2020 11-34-16

Fig. 3 – Rose. Initial mesh on the left, and approximated image to the right. 3 steps of subdivision using Loop scheme

Another addition to “subdivision” program can be used to demonstrate the interpolation of colors using Modified Butterfly scheme too. Let us look at the same example with tetrahedron:

12-05-2020 11-34-27

Fig. 4 – Tetrahedron after 5 subdivisions using Modified Butterfly subdivision scheme

Step 4. After k-th level of subdivision we project (by a subroutine, say, “Projection”) a mesh 12-05-2020 11-39-05 onto the surface S. Let 12-05-2020 11-39-19, where P is a projection, 12-05-2020 11-39-30.

Step 5. Now one should verify a condition 3). We suggest here to use a distance dbetween a barycenter of corresponding triangle and S (instead of d), and verify a condition 12-05-2020 11-40-18. Let the subroutine be called “Distance”. For the mesh to be conforming, we can use a method from [7] for dividing big triangles into several smaller ones.


  1. “Fuji technical research” company. Private communications, Tokyo, 2000.
  2. Gerald Farin “Curves and surfaces for CAGD”. Academic press, 1993.
  3. Ichiro Hagiwara. Private communications, Tokyo Institute of Technology, 2000.
  4. Ho-Le K. “Finite element mesh generation methods: review and classification”. Computer-Aided Design, 20:27-38, 1988
  5. K.-J. Bathe “Finite Element Procedures”. Prentice-Hall, 1996
  6. “Subdivision for Modeling and Animation”. SIGGRAPH 99 Course Notes.
  7. Rivara M.C. “Algorithms for refining triangular grids suitable for adaptive and multi-grid techniques”. Int. J. Numer. Meth. Eng. Vol 20 (1984) pp. 745-756.
  8. Dmitry Berzin “Finite element mesh generation using subdivision technique” // Research Journal of International Studies, №8 (27) 2014, p. 6
  9. Dmitry Berzin “Finite element automatic mesh generation using Modified Butterfly subdivision scheme” // Research Journal of International Studies, №8 (27) 2014, p. 8

Leave a Comment

Your email address will not be published. Required fields are marked *

Лимит времени истёк. Пожалуйста, перезагрузите CAPTCHA.