Premium
A fast algorithm for detecting admissible cuts in prestressed hollow core units
Author(s) -
Tomasiello Stefania
Publication year - 2010
Publication title -
international journal for numerical methods in biomedical engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.741
H-Index - 63
eISSN - 2040-7947
pISSN - 2040-7939
DOI - 10.1002/cnm.1153
Subject(s) - core (optical fiber) , cover (algebra) , function (biology) , span (engineering) , algorithm , precast concrete , computer science , mathematical optimization , mathematics , structural engineering , engineering , mechanical engineering , telecommunications , evolutionary biology , biology
In this paper a fast algorithm based on a recursive function to solve a design problem for the precast industry is presented. The problem can be summarized as follows: for a given span in the direction of the supporting beams, how many hollow core units of suitable length are necessary to cover exactly all the span, since the cuts in the hollow units can be made just in some admissible intervals because of some production constraints and the geometry is a customer requirement. The mathematical model and the algorithm are here discussed, proving that the computing time of the recursive function is O ( n ). Copyright © 2008 John Wiley & Sons, Ltd.