Premium
A line clipping algorithm and its analysis
Author(s) -
Krammer Gergely
Publication year - 1992
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.1130253
Subject(s) - clipping (morphology) , computer science , algorithm , computer graphics , raster graphics , line (geometry) , graphics , sequence (biology) , parametric statistics , theoretical computer science , mathematics , computer graphics (images) , geometry , philosophy , linguistics , biology , genetics , statistics
One of the classical problems of Computer Graphics: line clipping against a rectangle is revisited. Coordinate raster refinement and some unusual forms of the parametric equation of the line are used to develop formulae for a line clipping algorithm. The algorithm is first presented in a form, where clarity of presentation is the prime concern. It is then transformed into one big nested branch, which after optimisation is assumed to be the most efficient form with a heavy cost on size. It is assumed that any mathematical consideration of the clipping problem would after a similar optimisation lead to a branching structure of equal complexity and speed. Line clipping thus belongs to the class of problems for which after a proper mathematical and logical analysis automatic program transformations may do the rest. This work has been supported by a grant from the Hungarian Academy of Sciences, Project No. OTKA 2572/1991