Table of Contents

## What is PK in Bresenham line drawing algorithm?

The sign of the decision parameter Pk is the same as that of dlower−dupper. If pk is negative, choose the lower pixel, otherwise choose the upper pixel. Where, (Yk+1) – Yk is either 0 or 1 depending on the sign of Pk.

**What is the advantage of Bresenham line drawing algorithm?**

It is fast and incremental. It executes fast but less faster than DDA Algorithm. The points generated by this algorithm are more accurate than DDA Algorithm. It uses fixed points only.

### Why Bresenham line drawing algorithm is better than DDA line drawing algorithm?

Key Differences Between DDA and Bresenham line drawing algorithm. Bresenham’s algorithm is more efficient and accurate than DDA algorithm. The DDA algorithm involves floating point values while in bresenham algorithm only integer values is included.

**Which is better DDA vs Bresenham?**

Bresenhams algorithm is faster than DDA algorithm in line drawing because it performs only addition and subtraction in its calculations and uses only integer arithmetic so it runs significantly faster. DDA algorithm is not as accurate and efficient as Bresenhm algorithm.

#### What is the disadvantage of Bresenham’s line drawing algorithm?

Disadvantages of Bresenham Line Drawing Algorithm- Though it improves the accuracy of generated points but still the resulted line is not smooth. This algorithm is for the basic line drawing. It can not handle diminishing jaggies.

**Why Bresenham line drawing algorithm is better than DDA?**

## What is Cohen Sutherland line clipping algorithm?

The Cohen–Sutherland algorithm is a computer-graphics algorithm used for line clipping. The algorithm divides a two-dimensional space into 9 regions and then efficiently determines the lines and portions of lines that are visible in the central region of interest (the viewport).

**What are the disadvantages of Bresenhams algorithm?**

Disadvantages of Bresenham Line Drawing Algorithm-

- Though it improves the accuracy of generated points but still the resulted line is not smooth.
- This algorithm is for the basic line drawing.
- It can not handle diminishing jaggies.

### What is difference between Bresenham’s and midpoint circle drawing algorithm?

Bresenham’s algorithm deals with integers, so is very less time and memory consuming. This algorithm is accurate and efficient as it avoids using round function or floating point calculations. Mid-point circle algorithm also avoids square root or trigonometric calculation by adopting integer operation only.

**How is Bresenham better than DDA?**