Methods for drawing thick lines, Computer Graphics

Assignment Help:

Describe any two methods for drawing thick lines.

Two method for drawing thick lines are: (1) Using the line- width command: "setline width scale factor (iw)" Line width parameter "iw" is assigned a positive number to indicate the relative width of the line to be displayed. A value of 1 specifies standard- width line. (2) For raster implementation, a standard width line is generated with single pixel at each sample position, as in the Bresenham algorithm. Other- width lines are displayed as positive integer multiples of the standard line by plotting additional pixel along adjacent parallel line paths. For lines with slope  magnitude less than 1, the line drawing routine can be modified to display thick lines by plotting a vertical span of pixels at each x position along the line. The number of pixel in each span is sat equal to the integer magnitude of parameter 1w. As shown in figure below a double width line is plotted by generating a parallel line above the original line path. For lines with slope magnitude greater then 1, thick lines can be plotted with horizontal spans, alternately picking up pixels to the right and left of the line path.


Related Discussions:- Methods for drawing thick lines

Line generation algorithms - graphic primitives, Line Generation Algorithms...

Line Generation Algorithms - Graphic Primitives In previous section we have discussed the case of frame buffer, here information regarding the image to be projected upon the

Write a code to continuously rotate square about pivot point, Write a code ...

Write a code to continuously rotate a square about a pivot point.    #include   static GLfloat rotat=0.0;   void init(void); void display(void); void reshape(int w

Interlaced gif, Interlaced GIF: The conventional which is non-interlaced G...

Interlaced GIF: The conventional which is non-interlaced GIF graphic downloads one line of pixels at one time from top to bottom and browsers display all lines of the image as it

Scan line algorithm - output primitives, Scan Line Algorithm A scan lin...

Scan Line Algorithm A scan line algorithm determines the overlap intervals of the polygon with each scan line to obtain interior points of the polygon for assigning those point

Gourand shading, what is ray tracing algorithm in hidden surface removal

what is ray tracing algorithm in hidden surface removal

Principal vanishing point write respect to z-axis, Principal vanishing poin...

Principal vanishing point write respect to Z-axis Principal vanishing point w.r.t z-axis: By the 3rd row of matrix equation, we declare that the principal vanishing point w

Achieve a perspective projection on the plane of unit cube, Achieve a persp...

Achieve a perspective projection on the z = 0 plane of the unit cube, demonstrated in Figure (l) from the cop at E (0, 0, 10) upon the z-axis. Figure: I 01:  currently c

Important points about the surface of revolution, Important points about th...

Important points about the Surface of Revolution a) if a point on base curve is given by parametric form, that are: (x(u), y(u), z(u)) so surface of revolution regarding to th

How many key frames does a one-minute animation film, How many key frames d...

How many key frames does a one-minute animation film order along with no duplications need? Solution : One minute = 60 seconds Number of frames needed per second=24 Numbe

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd