Line generation for incremental and raster devices

Authors:
R. A. Earnshaw
Affiliations:
University of Leeds, LEEDS, LS2 9JT, ENGLAND U.K.
Venue:
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Year:
1977

Citing 2
Cited 1

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A Discipline of Programming

A Discipline of Programming

Real-time raster scan unit with improved picture quality

ACM SIGGRAPH Computer Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The characteristics,properties and generative sequences of line generation algorithms for incremental and raster devices are summarized and the mappings from one into the other are discussed. Extensions to the basic algorithms to exploit a greater variety of possible operations in the basic hardware set of incremental devices and also to cater for various types of curve are summarized.A new method of partitioning based upon derived code sequences and code patterns is presented and is shown to lead to significant code sequence compression (more than 40%) in the majority of cases, and more importantly a significant overall reduction of between 20% and 43% in the total central processor usage. Algorithms for encoding the sequences are presented.