A line clipping algorithm and its analysis

Simple item page
dc.contributor.authorKrammer, Gergelyen_US
dc.date.accessioned2014-10-21T07:20:09Z
dc.date.available2014-10-21T07:20:09Z
dc.date.issued1992en_US
dc.description.abstractOne 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/1991en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume11en_US
dc.identifier.doi10.1111/1467-8659.1130253en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages253-266en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1130253en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleA line clipping algorithm and its analysisen_US
Files
Collections
Issue 3
EG 1992 Conference Proceedings