Back Rasterung von Kreisen#Midpoint-Algorithmus German Algoritmo del punto medio para circunferencias Spanish Algorithme de tracé d'arc de cercle de Bresenham French ბრეზენჰემის წრეწირის რკალის აგების ალგორითმი Georgian Алгоритм построения окружности методом средней точки Russian Растеризація кола Ukrainian

Midpoint circle algorithm

Rasterizing a circle of radius 23 with the Bresenham midpoint circle algorithm. Only the green   octant is actually calculated, it is simply mirrored eight times to form the other seven octants.
A circle of radius 23 drawn by the Bresenham algorithm

In computer graphics, the midpoint circle algorithm is an algorithm used to determine the points needed for rasterizing a circle. It is a generalization of Bresenham's line algorithm. The algorithm can be further generalized to conic sections.[1][2][3]

  1. ^ Donald Hearn; M. Pauline Baker (1994). Computer graphics. Prentice-Hall. ISBN 978-0-13-161530-4.
  2. ^ Pitteway, M.L.V., "Algorithm for Drawing Ellipses or Hyperbolae with a Digital Plotter", Computer J., 10(3) November 1967, pp 282–289
  3. ^ Van Aken, J.R., "An Efficient Ellipse Drawing Algorithm", CG&A, 4(9), September 1984, pp 24–35

Rich TVX News Network Site

Rich TVX News Network Info

© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search