Premium
Bresenham's Line Generation Algorithm with Built‐in Clipping
Author(s) -
Kuzmin Yevgeny P.
Publication year - 1995
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.1450275
Subject(s) - correctness , computer science , clipping (morphology) , algorithm , line (geometry) , line segment , artificial intelligence , mathematics , linguistics , philosophy , geometry
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.