Calculus domains modelled using an original bool algebra based on polygons

4th ModTech International Conference - Modern Technologies in Industrial Engineering

Oanta, E.^1 ; Panait, C.^1 ; Raicu, A.^1 ; Barhalescu, M.^1 ; Axinte, T.^1

Constanta Maritime University, Faculty of Naval Electro-Mechanics, 104 Mircea cel Batran Street, Constanta

900663, Romania^1

关键词: Arbitrary precision;    Commercial software;    Computer codes;    Computer-based models;    Curved boundary;    Discretizations;    Geometrical characteristics;    Spline approximations;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/145/8/082011/pdf
DOI  :  10.1088/1757-899X/145/8/082011

来源: IOP

【 摘 要 】

Analytical and numerical computer based models require analytical definitions of the calculus domains. The paper presents a method to model a calculus domain based on a bool algebra which uses solid and hollow polygons. The general calculus relations of the geometrical characteristics that are widely used in mechanical engineering are tested using several shapes of the calculus domain in order to draw conclusions regarding the most effective methods to discretize the domain. The paper also tests the results of several CAD commercial software applications which are able to compute the geometrical characteristics, being drawn interesting conclusions. The tests were also targeting the accuracy of the results vs. the number of nodes on the curved boundary of the cross section. The study required the development of an original software consisting of more than 1700 computer code lines. In comparison with other calculus methods, the discretization using convex polygons is a simpler approach. Moreover, this method doesn't lead to large numbers as the spline approximation did, in that case being required special software packages in order to offer multiple, arbitrary precision. The knowledge resulted from this study may be used to develop complex computer based models in engineering.