Q1: consider the algorithm below, Step 1: Input the two line endpoints, storing the left endpoint in (Xa, Ya) and Right endpoint in (X2, Y2) Step 2: Plot the point (X1, Y:) Step 3: Calculate the constants, Ax, Ay, 2Ay and (2Ay - 2Ax) and get the first value for the decision parameter as: Po = 2Ay - Ax Step 4: At each Xx along the line, starting at K-0, perform the following test: if Pk < 0, the next point to plot is (Xa+1, Y«) and Pk1 - Pk+2Ay Otherwise the next point to plot is (Xx+1, Yk+1) and: Pw1- Pk + 2Ay - 2Ax Step 5: Repeat step 4, Ax times. Explain each step then compare it with DDA algorithm.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Q1: consider the algorithm below,
Step 1:
Input the two line endpoints, storing the left endpoint in (X1, Ya)
and Right endpoint in (X2, Y2)
Step 2:
Plot the point (X1, Y1)
Calculate the constants, Ax, Ay, 2Ay and (2Ay - 2Ax) and get the
first value for the decision parameter as:
Step 3:
Po = 2Ay - Ax
Step 4:
At each Xx along the line, starting at K-0, perform the following
test: if Pk < 0, the next point to plot is (Xx+1, Yk) and
Pk+1 = Pk + 2Ay
Otherwise the next point to plot is (X+1, Yx+1) and:
P1 - Pk + 2Ay - 2Ax
Step 5:
Repeat step 4, Ax times.
Explain each step then compare it with DDA algorithm.
Transcribed Image Text:Q1: consider the algorithm below, Step 1: Input the two line endpoints, storing the left endpoint in (X1, Ya) and Right endpoint in (X2, Y2) Step 2: Plot the point (X1, Y1) Calculate the constants, Ax, Ay, 2Ay and (2Ay - 2Ax) and get the first value for the decision parameter as: Step 3: Po = 2Ay - Ax Step 4: At each Xx along the line, starting at K-0, perform the following test: if Pk < 0, the next point to plot is (Xx+1, Yk) and Pk+1 = Pk + 2Ay Otherwise the next point to plot is (X+1, Yx+1) and: P1 - Pk + 2Ay - 2Ax Step 5: Repeat step 4, Ax times. Explain each step then compare it with DDA algorithm.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY