Fast Lines: a Span by Span Method

Simple item page
dc.contributor.authorBoyer, V.en_US
dc.contributor.authorBourdin, J.J.en_US
dc.date.accessioned2015-02-16T06:55:33Z
dc.date.available2015-02-16T06:55:33Z
dc.date.issued1999en_US
dc.description.abstractStraight line's scan conversion and drawing is a major field in computer graphics. Algorithm's time computation is very important. Nowadays, most of research papers suggest improvements of the DDA method that was first presented by J. Bresenham. But other approaches exist as well like combinatory analysis and linguistic methods. Both of them use multiple string copies that slow down the efficiency of the algorithms. This paper proposes a new algorithm based on a careful analysis of the line segments' properties some of them previously unused. Our algorithm is proved significantly faster than previously published ones.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume18en_US
dc.identifier.doi10.1111/1467-8659.00358en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages377-384en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.00358en_US
dc.publisherBlackwell Publishers Ltd and the Eurographics Associationen_US
dc.titleFast Lines: a Span by Span Methoden_US
Files
Collections
Issue 3