Abstract
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.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
