Question

How the next pixel is selected in bresenhm algorithm?

Answer 1

In Bresenham's algorithm at any point (x, y) we have two option either to choose the next pixel in the east i.e. (x+1, y) or in the south east i.e. (x+1, y-1). And this can be decided by using the decision parameter d as: If d > 0, then (x+1, y-1) is to be chosen as the next pixel as it will be closer to the arc.