Methods for drawing thick lines, Computer Graphics

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.

Posted Date: 7/1/2012 6:42:55 AM | Location : United States







Related Discussions:- Methods for drawing thick lines, Assignment Help, Ask Question on Methods for drawing thick lines, Get Answer, Expert's Help, Methods for drawing thick lines Discussions

Write discussion on Methods for drawing thick lines
Your posts are moderated
Related Questions
Types of Formats It is significant to distinguish among a file format and a codec. Although most audio file formats support merely one audio codec, a file format may assist mul

Algorithms for Basic Line Segment Plotting There are two important algorithms for basic line segment plotting-DDA algorithm and Bresenham algorithm.  Both the algorithms use th

what is the numerical numbers

Explain the advantage and disadvantage of Raster CRT Advantages Allows solids, not just wireframes Leverages low-cost CRT technology (i.e., TVs) Bright, i.e.

Test For checking Disjoint Polygons by using of Min-max Test Test 1: For checking disjoint polygons by using of Min-max test. Assume that you have two polygons as P1 and

De Casteljau Algorithm For computation of Bézier curves an iterative algorithm known as de Casteljau algorithm is used.  The algorithm uses repeated linear interpolation.

Scan Conversion of Line with the slope (0 Currently the pixel positions beside the line path are determined through sampling at Unit x intervals that is, starting from the fi

Applications that can handle Bitmap Data Hundreds of applications are there in the market which can be used to modify or make bitmap data. For illustration: Adobe Photo Shop, C

example for desigining animation sequence

DDA or Digital Differential Analyzer Algorithm - Line generation algorithms From the above discussion we get that a Line drawing is accomplished through calculating intermedi