Premium
A method for the automatic generation of triangular elements on a surface
Author(s) -
Cohen Howard D.
Publication year - 1980
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620150314
Subject(s) - quadrilateral , row , polygon (computer graphics) , surface (topology) , subroutine , discretization , point (geometry) , row and column spaces , division (mathematics) , column (typography) , algorithm , computer science , mathematics , geometry , finite element method , arithmetic , structural engineering , mathematical analysis , engineering , telecommunications , frame (networking) , database , connection (principal bundle) , operating system
An algorithm is given to discretize a polygon or curved surface into triangular arrays. The method first involves the manual division of the array into quadrilaterals with specified numbers on rows and columns. The individual points are then filled in automatically and elements are automatically generated. A point of particular importance is that the number of columns or rows may be made to change. A subroutine is given to perform this task.