Midpoint circle algorithm

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

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

Summary edit

This algorithm draws all eight octants simultaneously, starting from each cardinal direction (0°, 90°, 180°, 270°) and extends both ways to reach the nearest multiple of 45° (45°, 135°, 225°, 315°). It can determine where to stop because when y = x, it has reached 45°. The reason for using these angles is shown in the above picture: As x increases, it neither skips nor repeats any x value until reaching 45°. So during the while loop, x increments by 1 each iteration, and y decrements by 1 on occasion, never exceeding 1 in one iteration. This changes at 45° because that is the point where the tangent is rise=run. Whereas rise>run before and rise<run after.

The second part of the problem, the determinant, is far trickier. This determines when to decrement y. It usually comes after drawing the pixels in each iteration, because it never goes below the radius on the first pixel. Because in a continuous function, the function for a sphere is the function for a circle with the radius dependent on z (or whatever the third variable is), it stands to reason that the algorithm for a discrete(voxel) sphere would also rely on this Midpoint circle algorithm. But when looking at a sphere, the integer radius of some adjacent circles is the same, but it is not expected to have the same exact circle adjacent to itself in the same hemisphere. Instead, a circle of the same radius needs a different determinant, to allow the curve to come in slightly closer to the center or extend out farther.

Algorithm edit

The objective of the algorithm is to approximate a circle, more formally put, to approximate the curve   using pixels; in layman's terms every pixel should be approximately the same distance from the center, as is the definition of a circle. At each step, the path is extended by choosing the adjacent pixel which satisfies   but maximizes  . Since the candidate pixels are adjacent, the arithmetic to calculate the latter expression is simplified, requiring only bit shifts and additions. But a simplification can be done in order to understand the bitshift. Keep in mind that a left bitshift of a binary number is the same as multiplying with 2. Ergo, a left bitshift of the radius only produces the diameter which is defined as radius times two.

This algorithm starts with the circle equation. For simplicity, assume the center of the circle is at  . To start with, consider the first octant only, and draw a curve which starts at point   and proceeds counterclockwise, reaching the angle of 45°.

The fast direction here (the basis vector with the greater increase in value) is the   direction (see Differentiation of trigonometric functions). The algorithm always takes a step in the positive   direction (upwards), and occasionally takes a step in the slow direction (the negative   direction).

From the circle equation is obtained the transformed equation  , where   is computed only once during initialization.

Let the points on the circle be a sequence of coordinates of the vector to the point (in the usual basis). Points are numbered according to the order in which drawn, with   assigned to the first point  .

For each point, the following holds:


This can be rearranged thus:


And likewise for the next point:


Since for the first octant the next point will always be at least 1 pixel higher than the last (but also at most 1 pixel higher to maintain continuity), it is true that:


So, rework the next-point-equation into a recursive one by substituting  :


Because of the continuity of a circle and because the maxima along both axes is the same, clearly it will not be skipping x points as it advances in the sequence. Usually it stays on the same x coordinate, and sometimes advances by one to the left.

The resulting coordinate is then translated by adding midpoint coordinates. These frequent integer additions do not limit the performance much, as those square (root) computations can be spared in the inner loop in turn. Again, the zero in the transformed circle equation is replaced by the error term.

The initialization of the error term is derived from an offset of ½ pixel at the start. Until the intersection with the perpendicular line, this leads to an accumulated value of   in the error term, so that this value is used for initialization.

The frequent computations of squares in the circle equation, trigonometric expressions and square roots can again be avoided by dissolving everything into single steps and using recursive computation of the quadratic terms from the preceding iterations.

Variant with integer-based arithmetic edit

Just as with Bresenham's line algorithm, this algorithm can be optimized for integer-based math. Because of symmetry, if an algorithm can be found that only computes the pixels for one octant, the pixels can be reflected to get the whole circle.

We start by defining the radius error as the difference between the exact representation of the circle and the center point of each pixel (or any other arbitrary mathematical point on the pixel, so long as it's consistent across all pixels). For any pixel with a center at  , the radius error is defined as:


For clarity, this formula for a circle is derived at the origin, but the algorithm can be modified for any location. It is useful to start with the point   on the positive X-axis. Because the radius will be a whole number of pixels, clearly the radius error will be zero:


Because it starts in the first counter-clockwise positive octant, it will step in the direction with the greatest travel, the Y direction, so it is clear that  . Also, because it concerns this octant only, the X values have only 2 options: to stay the same as the prior iteration, or decrease by 1. A decision variable can be created that determines if the following is true:


If this inequality holds, then plot  ; if not, then plot  . So, how to determine if this inequality holds? Start with a definition of radius error:


The absolute value function does not help, so square both sides, since a square is always positive:


Since x > 0, the term  , so dividing gets:


Thus, the decision criterion changes from using floating-point operations to simple integer addition, subtraction, and bit shifting (for the multiply by 2 operations). If  , then decrement the x value. If  , then keep the same x value. Again, by reflecting these points in all the octants, a full circle results.

We may reduce computation by only calculating the delta between the values of this decision formula from its value at the previous step. We start by assigning   as   which is the initial value of the formula at  , then as above at each step if   we update it as   (and decrement X), otherwise   thence increment Y as usual.

Jesko's Method edit

The algorithm has already been explained to a large extent, but there are further optimizations.

The new presented method[4] gets along with only 5 arithmetic operations per step (for 8 pixels) and is thus just for low-performate systems best suitable. In the "if" operation, only the sign is checked (positive? Yes or No) and there is a variable assignment, which is also not considered an arithmetic operation. The initialization in the first line (shifting by 4 bits to the right) is only due to beauty and not really necessary.

So we get countable operations within main-loop:

  1. The comparison x >= y (is counted as a substraction: x - y >= 0 )
  2. y=y+1 [y++]
  3. t1 + y
  4. t1 - x
    1. The comparison t2 >= 0 is NOT counted as no real arithmetic takes place. In Two's-complement representation of the vars only the sign bit has to be checked.
  5. x=x-1 [x--]

Operations: 5

t1 = r / 16
x = r
y = 0
Repeat Until x < y
    Pixel (x, y) and all symmetric pixels are colored (8 times)
    y = y + 1
    t1 = t1 + y
    t2 = t1 - x
    If t2 >= 0
        t1 = t2
        x = x - 1

Drawing incomplete octants edit

The implementations above always draw only complete octants or circles. To draw only a certain arc from an angle   to an angle  , the algorithm needs first to calculate the   and   coordinates of these end points, where it is necessary to resort to trigonometric or square root computations (see Methods of computing square roots). Then the Bresenham algorithm is run over the complete octant or circle and sets the pixels only if they fall into the wanted interval. After finishing this arc, the algorithm can be ended prematurely.

If the angles are given as slopes, then no trigonometry or square roots are necessary: simply check that   is between the desired slopes.

Generalizations edit

It is also possible to use the same concept to rasterize a parabola, ellipse, or any other two-dimensional curve.[5]

References edit

  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
  4. ^ For the history of the publication of this algorithm see https://schwarzers.com/algorithms
  5. ^ Zingl, Alois (December 2014). "The Beauty of Bresenham's Algorithm: A simple implementation to plot lines, circles, ellipses and Bézier curves". easy.Filter. Alois Zingl. Retrieved 16 February 2017.

External links edit