Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

Question

Question Answer

🔍

🖊️Ask a Question

Electrical Engineering

Question Answer

Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

by anonymous asked Feb 6, 2021 30 views

Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

1 Answer

Related questions

by anonymous asked Feb 27, 2021 18 views

Consider the line from (0,0) to (4,6). Use the simple DDA algorithm to rasterize this line.

View solution

0 like 0 dislike

0 answers

by anonymous asked Feb 7, 2021 14 views

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). ... s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD
Answer : (D) AB and CD...

View solution

0 like 0 dislike

1 answer

by anonymous asked Feb 7, 2021 10 views

Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10
Answer : (D) 9, 10...

View solution

0 like 0 dislike

1 answer

by anonymous asked Feb 9, 2021 21 views

Consider a window bounded by the lines : x = 0; y= 0; x = 5 and y = 3. The line segment joining (–1, 0) and (4, 5), if clipped against this window will connect the points (A) (0, 1) and (2, 3) (B) (0, 1) and (3, 3) (C) (0, 1) and (4, 3) (D) (0, 1) and (3, 2)

Consider a window bounded by the lines : x = 0; y= 0; x = 5 and y = 3. The line segment joining (–1, 0) and (4, 5), if clipped against this window will connect the points (A) (0, 1) and (2, 3) (B) (0, 1) and (3, 3) (C) (0, 1) and (4, 3) (D) (0, 1) and (3, 2)
Answer : (A) (0, 1) and (2, 3)...

View solution

0 like 0 dislike

1 answer

by anonymous asked Feb 6, 2021 13 views

Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d<0, then d=4x+6 and x=x+1 (4) If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d
Answer : If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1...

View solution

0 like 0 dislike

1 answer

anonymous · Answer 1 · 2021-02-06T18:38:35+0000

by anonymous answered Feb 6, 2021

[(0, 0), (1, 1), (2, 1), (3, 2)]

Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

Please log in or register to add a comment.

1 Answer

Please log in or register to add a comment.

Related questions