The Quick and Simple Algorithm for Circular Interpolation
Jia Ying Zhang
Abstract
Jia Ying Zhang
Abstract
In this paper, a quick and simple algorithm based on data sampling principle for circular interpolation is introduced. The algorithm uses a set of chord lines which having same corner angle to approxmate to circle. Comparing with the most other interpolation algorithm,this algorithm is quick, simple and being have little error for the circular interpolation. The algorithm is balanced with the speed and the accuracy of caculation well. The cutting process is more smoothly.
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.
In this paper, a quick and simple algorithm based on data sampling principle for circular interpolation is introduced. The algorithm uses a set of chord lines which having same corner angle to approxmate to circle. Comparing with the most other interpolation algorithm,this algorithm is quick, simple and being have little error for the circular interpolation. The algorithm is balanced with the speed and the accuracy of caculation well. The cutting process is more smoothly.
Key concepts: Interpolation (computer graphics), Chord (peer-to-peer), Simple (philosophy), Algorithm, SIMPLE algorithm, Trilinear interpolation, Set (abstract data type), Mathematics