| dc.contributor.author | Kuzmin, Yevgeny P. | en_US |
| dc.date.accessioned | 2014-10-21T07:39:40Z | |
| dc.date.available | 2014-10-21T07:39:40Z | |
| dc.date.issued | 1995 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1111/1467-8659.1450275 | en_US |
| dc.description.abstract | One of the most important operations in many graphical systems is the generation of a line segment. This process consists of two stages: clipping and drawing. These two stages are separated in current graphical applications. In this paper a new approach to line generation is proposed, which unifies these stages. The proposed algorithm is based on Bresenham s line generation algorithm to include necessary line clipping. The line clipping stage is an operation-reduced, integer arithmetic only algorithm. The notion of correctness of line clipping is introduced and correctness of the proposed algorithm is shown. Complete C-notation of the algorithm is included. | en_US |
| dc.publisher | Blackwell Science Ltd and the Eurographics Association | en_US |
| dc.title | Bresenham's Line Generation Algorithm with Built-in Clipping | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 14 | en_US |
| dc.description.number | 5 | en_US |
| dc.identifier.doi | 10.1111/1467-8659.1450275 | en_US |
| dc.identifier.pages | 275-280 | en_US |
