Citation:

M. Sangeetha, S. Amaresan, 2022. "Line Drawing Algorithms in Computer Graphics", ESP Journal of Engineering & Technology Advancements (ESP-JETA)  2(1): 12-16.

Abstract:

Straight-line drawing calculations depend on steady techniques, Inincremental allotted line begins with a straight point then, at that point, some fixed incrementable is added to the ongoing point to get the following point on the web and some are proceeded with all as far as it goes. Line drawing on the PC infers the PC screen is secluded into two areas sections and portions. Those lines and segments are otherwise called a Pixels. In the event of we need to define a boundary on the PC, as a matter of first importance, we want to know which pixels ought to be on. A line is a piece of straight line that stretches out the other way endlessly. A line is characterized by two Endpoints. Its thickness ought to be fine isolated from the length of the line.

References:

[1] Bei Chuan Chen, Yu-Tai Ching Journal: Computers and Graphics, 25(2)(2001), http://dx.doi.org/10.1016/s0097-8493(00)00123-0
[2] Author: Ashley HavindenPublisher:StudioYear:1941
[3] Author: Martin Nöllenburg Book:Graph Drawing Publisher:Springer Berlin Heidelberg City : Berlin, Heidelberg (2010)381-392. http://dx.doi.org/10.1007/978-3-642-11805-0_36

Keywords:

Computer graphics, Line drawing.