Bresenham's Line Generation Algorithm with Built-in Clipping

Simple item page
dc.contributor.authorKuzmin, Yevgeny P.en_US
dc.date.accessioned2014-10-21T07:39:40Z
dc.date.available2014-10-21T07:39:40Z
dc.date.issued1995en_US
dc.description.abstractOne 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.description.number5en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume14en_US
dc.identifier.doi10.1111/1467-8659.1450275en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages275-280en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1450275en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleBresenham's Line Generation Algorithm with Built-in Clippingen_US
Files
Collections
Issue 5