Equation of initial decision parameter for Bresenham line algorithm is :
a) 𝒫0 = Δ𝒴 – Δϰ
b) 𝒫0 = 2 Δ𝒴 – Δϰ
c) 𝒫0 = 2 Δ𝒴 – 2 Δϰ
d) 𝒫0 = Δ𝒴 – 2 Δϰ
Equation of initial decision parameter for the midpoint circle algorithm is :
a) 𝒫0 = 1 – r
b) 𝒫0 = 1 + r
c) 𝒫0 = 1 + 2r
d) 𝒫0 = 1 − 2r
For complicated shape in the flood fill algorithm we use :
a) 2 connected region
b) 4 connected region
c) 6 connected region
d) 8 connected region
What is true about the DDA algorithm for the scan conversion of a line?
a) General-purpose method
b) Incremental method
c) Current calculation is independent of previous step
d) Is slower than the use of line equation
In DDA algorithm for scan conversion of a line :
a) if |m| <= 1then Δϰ = 1
b) if |m| >= 1then Δϰ = 1
c) if |m| <= 1then Δy = 1
d) All of these
Which of these is false for Boundary-fill algorithm?
a) Recursive algorithm
b) Begins with a starting point called seed
c) It checks for any pixel to be boundary color
d) Works only for rectangles and circles
