Algorithm of Minimum Arc Approximating Curve and Realization in Matlab
WU Guang-jin
Abstract
WU Guang-jin
Abstract
Introduces the algorithm of three points arc in maximum error approximating curve,theoretically making arc approximated sections minimum.Based on Matlab nodes are solved through programming,and theoretical arc is replaced by arc of equal chord and equal arc length to search for initial value of node so as to ensure reliable and rapid running of the program.Arcs have smooth connections and numerical control program segments are less and efficient.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Introduces the algorithm of three points arc in maximum error approximating curve,theoretically making arc approximated sections minimum.Based on Matlab nodes are solved through programming,and theoretical arc is replaced by arc of equal chord and equal arc length to search for initial value of node so as to ensure reliable and rapid running of the program.Arcs have smooth connections and numerical control program segments are less and efficient.
Key concepts: Arc length, Chord (peer-to-peer), Arc (geometry), MATLAB, Algorithm, Mathematics, Realization (probability), Curve fitting