Antialiased Digital Pixel Plotting for Raster Scan Lines Using Area Evaluation
A picture in digital form can be described as a formation of pixels that are to be specified by the set intensities in the display device. In engineering and design architectures drawing of the linear form of the curves predominates especially in wire fra
- PDF / 224,357 Bytes
- 8 Pages / 439.37 x 666.142 pts Page_size
- 55 Downloads / 162 Views
Abstract A picture in digital form can be described as a formation of pixels that are to be specified by the set intensities in the display device. In engineering and design architectures drawing of the linear form of the curves predominates especially in wire frame objects. Although line plotting is a minimal concept in drawing, minimizing a fraction of the computation is considerable because objects contain enormous linear wire frames. In this paper an algorithm is proposed to plot a curve by minimizing calculations which is valued for any generalized curve.
Keywords Digital curves Scan conversions Line drawing algorithms Geometric objects
Aliasing Right angle triangle
1 Introduction Drawing the geometric objects in the context of plotting line segments and curves in the present raster graphical framework needs proficient algorithms. Plotting the two points in a two-dimensional region in a linear form for the points (x0, y0) and (x1, y1) in a graphics system looks to be a moderately easy task. This can be seen in currently existing algorithms that seem to be efficient and small [1–4]. It will turn
E. Mamatha (&) Department of Mathematics, GITAM University, Bengaluru, India e-mail: [email protected] C.S. Reddy School of Computing, SASTRA University, Tanjore, India e-mail: [email protected] K.R. Prasad Colleges of MPS, SV University, Tirupathi, India © Springer Science+Business Media Singapore 2016 N.R. Shetty et al. (eds.), Emerging Research in Computing, Information, Communication and Applications, DOI 10.1007/978-981-10-0287-8_43
461
462
E. Mamatha et al.
out that the existing methods can lead to evaluating the pixels on the raster system but some algorithms are consuming more time by using rounding and multiplication value calculations. However, most of the geometric objects are predominated by wire frames that are linear curves, hence optimizing a fraction of computing time leads to a better solution. For simplicity point of view it is presumed that two endpoints are connected by a segment line that lies in the pixel raster system. That is, the dimensional coordinates in a two-dimensional system are represented by integral numbers. Without loss of generality in this paper the first point can be taken as the left-hand side in the coordinate system of the line and is not placed on the right-hand side to the second point. From this it is observed that x0 < x1 holds good for all conditions. In the case where this condition is not fulfilled, the two endpoints of a line segment can be swapped for plotting the line. Curve rendering on raster devices, a fundamental operation in computer graphics, is essentially a process of quantizing (digitizing) continuous two-dimensional visual signals at the sampling rate of the device resolution. This sampling rate is usually significantly lower than twice the maximum frequency of object boundaries and curve edges, resulting in a loss of information as explained by the Shannon sampling theorem. This information loss is the reason for the existence of visually u
Data Loading...
