What are the qualities of a good line drawing algorithm?

What are the qualities of a good line drawing algorithm?
by

1 Answer

Answer :

Speed and accuracy.
by

Related questions

Explain and write steps for DDA line drawing algorithm.

Description : Explain and write steps for DDA line drawing algorithm. 

Last Answer : This algorithm generates a line from differential equations of line and hence the name DDA. DDA algorithm is an incremental scan conversion method. A DDA is hardware or software used for linear interpolation of variables over ... : Steps 1: Read the end points of line (x1,y1) and (x2,y2).

List any two line drawing algorithms. Also, list two merits of any line drawing algorithm.

Description : List any two line drawing algorithms. Also, list two merits of any line drawing algorithm.

Last Answer : Line drawing algorithms: Digital Differential Analyzer (DDA) algorithm Bresenham's algorithm Merits of DDA algorithms: It is the simplest algorithm and it does not require special skills ... , and multiplication by 2, which can be accomplished by a simple arithmetic shift operation.

Bresenham line drawing algorithm is attractive because it uses (A) Real arithmetic only (B) Integer arithmetic only (C) Floating point arithmetic (D) Real and integer arithmetic

Description : Bresenham line drawing algorithm is attractive because it uses (A) Real arithmetic only (B) Integer arithmetic only (C) Floating point arithmetic (D) Real and integer arithmetic

Last Answer : (B) Integer arithmetic only

Which one of the following following factors factors does not affect the volume and revenue for a service firm? a. affluence affluence of customer customer drawing drawing area b. competition competition in the area c. physical physical qualities qualities of facilities facilities and neighboring neighboring businesses d. businesses d. quality of the competition quality of the competition e. environmental regulations

Description : Which one of the following following factors factors does not affect the volume and revenue for a service firm? a. affluence affluence of customer customer drawing drawing area b. competition ... d. businesses d. quality of the competition quality of the competition e. environmental regulations

Last Answer : e. environmental regulations

Write a Program in ‘C’ for DDA Circle drawing algorithm

Description : Write a Program in ‘C’ for DDA Circle drawing algorithm

Last Answer : #include<stdio.h> #include<conio.h> #include<graphics.h> #include<math.h> void main() { int gdriver=DETECT,gmode,errorcode,tmp,i=1,rds; float st_x,st_y,x1,x2,y1,y2,ep; initgraph(& ... =y2; }while((y1-st_y)<ep || (st_x-x1)>ep); getch(); }

Best line following algorithm?

Description : Best line following algorithm?

Last Answer : This brings back memories of the robotics club in high school. Unfortunately, I was the engineer and not the programmer. :[ Umm, you might want to look at this. It seems like a simple explanation of line following for robots.

If delaysare recorded as 10 bit numbers in a 50 router network, and delay vectorsare exchanged twicea second,how muchbandwidth per fill duplex line is occupied by the distributedrouting algorithm? A. 500 bps B. 1500 bps C. 5 bps D. 1000 bps

Description : If delaysare recorded as 10 bit numbers in a 50 router network, and delay vectorsare exchanged twicea second,how muchbandwidth per fill duplex line is occupied by the distributedrouting algorithm? A. 500 bps B. 1500 bps C. 5 bps D. 1000 bps

Last Answer : 1000 bps

______ is a static algorithm in which every incoming packet is sent out on every outgoing line except the one it arrives on. This method usually generates vast number of duplicate packets.. A. Flooding B. Wait and watch C. congestion D. both a and c

Description : ______ is a static algorithm in which every incoming packet is sent out on every outgoing line except the one it arrives on. This method usually generates vast number of duplicate packets.. A. Flooding B. Wait and watch C. congestion D. both a and c

Last Answer : A. Flooding

Write down Cyrus-Beck line clipping algorithm.

Description : Write down Cyrus-Beck line clipping algorithm.

Last Answer : Step 1: Read end points of line P1 and P2. Step 2: Read vertex coordinates of clipping window. Step 3: Calculate D = P2 - P1. Step 4: Assign boundary point b with particular edge. Step 5: Find ... parametric equation of line P1P2. Step 12: Draw line segment P(tL) to P(tU). Step 13: Stop.

Write down Cohen-Sutherland Line clipping algorithm.

Description : Write down Cohen-Sutherland Line clipping algorithm.

Last Answer : Step 1: Scan end points for the line P1(x1, y1) and P2(x2, y2) Step 2: Scan corners for the window as (Wx1, Wy1) and (Wx2, Wy2) Step 3: Assign the region codes for endpoints P1 and P2 by ... if any of the end point of it appear outside the window. Step 8: Draw the remaining line. Step 9: Exit

Write the midpoint subdivision algorithm for line clipping.

Description : Write the midpoint subdivision algorithm for line clipping.

Last Answer : Step 1: Scan two end points for the line P1(x1, y1) and P2(x2, y2). Step 2: Scan corners for the window as (x1, y1) and (x2, y2). Step 3:Assign the region codes for ... 5 for both subdivided line segments until you get completely visible and completely invisible line segments. Step 6: Exit.

Explain Cyrusblek line clipping algorithm.

Description : Explain Cyrusblek line clipping algorithm.

Last Answer : Cyrus Beck Line Clipping algorithm: Cyrus Beck Line Clipping algorithm is used to clip 2D/3D lines against convex polygon/polyhedron. Cyrus Beck Line clipping algorithm is actually, a parametric line-clipping algorithm. ... Step 12 : Draw line segment P(tL) to P(tU). Step 13 : Stop. 

Explain midpoint subdivision line clipping algorithm.

Description : Explain midpoint subdivision line clipping algorithm.

Last Answer : Step 1: Scan two end points for the line P1(x1, y1) and P2(x2, y2). Step 2: Scan corners for the window as (Wx1, Wy1) and (Wx2, Wy2). Step 3: Assign the region ... through 5 for both subdivided line segments until you get completely visible and completely invisible line segments. Step 6: Exit.

Explain scan line algorithm of polygon clipping.

Description : Explain scan line algorithm of polygon clipping.

Last Answer : For each scan line crossing a polygon, the area-fill algorithm locates the intersection points of the scan line with the polygon edges. These intersection points are then sorted from left to right ... 4 : Fill all those pair of coordinates that are inside polygons and ignore the alternate pairs.

Which raster locations would be chosen by Bresenham’s algorithm when scan converting a line from (1, 1) to (8, 5) ?

Description : Which raster locations would be chosen by Bresenham’s algorithm when scan converting a line from (1, 1) to (8, 5) ?

Last Answer : Answer: C

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

Description : 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

Last Answer : (D) AB and CD

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)]

Description : 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)]

Last Answer : [(0, 0), (1, 1), (2, 1), (3, 2)] 

Where is the drawing line between living a life that reflects the type of person you are, and using this as an excuse not to improve yourself?

Description : Where is the drawing line between living a life that reflects the type of person you are, and using this as an excuse not to improve yourself?

Last Answer : answer:Self actualization has to do with being the best person we can be. That means continuing growth no matter how old we are. It's not a matter of taking chances, it's a matter of being open ... going after new things just because they are new, but trying new things as they are presented to you.

How can you make the following equation true by drawing only one straight line: 5+5+5=550? Can you figure it out? -Riddles

Description : How can you make the following equation true by drawing only one straight line: 5+5+5=550? Can you figure it out? -Riddles

Last Answer : Draw a line on the first plus sign that turns it into a 4! The equation then becomes true: 545+5=550. You could also change the equal symbol to a crossed out equal symbol which means 'not equal to'.

Look at this image .this line drawing ,which can only be seen from high above was produced by which people ?

Description : Look at this image .this line drawing ,which can only be seen from high above was produced by which people ?

Last Answer : The Nazca (apex)

Look at this image .this line drawing ,which can only be seen from high above was produced by which people ?

Description : Look at this image .this line drawing ,which can only be seen from high above was produced by which people ?

Last Answer : The Nazca (apex)

A high quality CAD system uses the following for printing drawing and graphs A) Dot matrix printer B) Digital plotter C) Line printer D) All of the above

Description : A high quality CAD system uses the following for printing drawing and graphs A) Dot matrix printer B) Digital plotter C) Line printer D) All of the above

Last Answer : Answer : B

Prolongation of chain line across an obstruction in chain surveying, is done by (A) Making angular measurements (B) Drawing perpendiculars with a chain (C) Solution of triangles (D) All the above

Description : Prolongation of chain line across an obstruction in chain surveying, is done by (A) Making angular measurements (B) Drawing perpendiculars with a chain (C) Solution of triangles (D) All the above

Last Answer : (B) Drawing perpendiculars with a chain

The zone in which transverse bending is likely to occur may be obtained by drawing a line from the (A) 30° (B) 45° (C) 60° (D) None of these

Description : The zone in which transverse bending is likely to occur may be obtained by drawing a line from the (A) 30° (B) 45° (C) 60° (D) None of these

Last Answer : Answer: Option B

A high quality CAD system uses the following for printing drawing and graphs a. Dot matrix printer b. Digital plotter c. Line printer d. All of the above

Description : A high quality CAD system uses the following for printing drawing and graphs a. Dot matrix printer b. Digital plotter c. Line printer d. All of the above

Last Answer : b. Digital plotter

A high quality CAD system uses the following for printing drawing and graphs a. Dot matrix printer b. Digital plotter c. Line printer d. All of the above

Description : A high quality CAD system uses the following for printing drawing and graphs a. Dot matrix printer b. Digital plotter c. Line printer d. All of the above

Last Answer : b. Digital plotter

List / name two line drawing algorithms.

Description : List / name two line drawing algorithms.

Last Answer : Digital Differential Analyzer (DDA) Algorithm  Digital Differential Analyzer algorithm generates a line from differential equations of line and hence the name DDA. Bresenham’s Algorithm  The Bresenham algorithm is another line drawing algorithm which uses integer calculations for drawing line.