z-logo
Premium
The effectiveness of a new algorithm on a three‐dimensional finite element model construction of bone trabeculae in implant biomechanics
Author(s) -
Sato Y.,
Teixeira E. R.,
Tsuga K.,
Shindoi N.
Publication year - 1999
Publication title -
journal of oral rehabilitation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.991
H-Index - 93
eISSN - 1365-2842
pISSN - 0305-182X
DOI - 10.1046/j.1365-2842.1999.00442.x
Subject(s) - finite element method , biomechanics , representation (politics) , element (criminal law) , modulus , stress (linguistics) , computer science , trabecular bone , elastic modulus , biomedical engineering , structural engineering , algorithm , mathematics , materials science , engineering , geometry , anatomy , composite material , medicine , osteoporosis , linguistics , philosophy , politics , political science , law , endocrinology
More validity of finite element analysis (FEA) in implant biomechanics requires element downsizing. However, excess downsizing needs computer memory and calculation time. To evaluate the effectiveness of a new algorithm established for more valid FEA model construction without downsizing, three‐dimensional FEA bone trabeculae models with different element sizes (300, 150 and 75 μm) were constructed. Four algorithms of stepwise (1 to 4 ranks) assignment of Young's modulus accorded with bone volume in the individual cubic element was used and then stress distribution against vertical loading was analysed. The model with 300 μm element size, with 4 ranks of Young's moduli accorded with bone volume in each element presented similar stress distribution to the model with the 75 μm element size. These results show that the new algorithm was effective, and the use of the 300 μm element for bone trabeculae representation was proposed, without critical changes in stress values and for possible savings on computer memory and calculation time in the laboratory.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here