Abstract
AbstractIn 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal for Numerical Methods in Biomedical Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
