Midpoint Distance Circle Generation Algorithm based on Midpoint Circle Algorithm and Bresenham Circle Algorithm

• Published in: Journal of physics. Conference series Vol. 1438; no. 1; pp. 12017 - 12022
• Main Authors: Cao, Minghua, Liu, Siyuan, Cao, Fanghua
• Format: Journal Article
• Language: English
• Published: Bristol IOP Publishing 01.01.2020
• Subjects: Algorithms; Consumption; Mathematical analysis; Physics; Pixels
• ISSN: 1742-6588; 1742-6596
• DOI: 10.1088/1742-6596/1438/1/012017

In the process of generating a circle, the existing midpoint circle algorithm and Bresenham circle algorithm have the problems of slow drawing speed, high resource consumption, complicated calculation steps and large pixel spacing in some areas, and a combination of midpoint painting is proposed. A new algorithm for the circular algorithm and the Bresenham circular algorithm. The algorithm first calculates the positional relationship between the midpoint and the circumference of two adjacent pixel points, and then calculates the distance difference between two adjacent pixel points and the circle by two approximate distances, and then obtains the decision parameters of the algorithm. A complete circle is obtained by the symmetry of the octant. Experiments show that the proposed algorithm is an effective midpoint distance circle generation algorithm based on the midpoint circle algorithm and the Bresenham algorithm. Compared with similar algorithms, it has higher stability and precision, and has less resource consumption and more flexible calculation methods.