Back to search

University of North Texas

Computer Graphics Primitives and the Scan-Line Algorithm

Abstract

dc:description

This paper presents the scan-line algorithm which has been implemented on the Lisp Machine. The scan-line algorithm resides beneath a library of primitive software routines which draw more fundamental objects: lines, triangles and rectangles. This routine, implemented in microcode, applies the A(BC)*D approach to word boundary alignments in order to create an extremely fast, efficient, and general purpose drawing primitive. The scan-line algorithm improves on previous methodologies by limiting the number of CPU intensive instructions and by minimizing the number of words referenced. This paper will describe how to draw scan-lines and the constraints imposed upon the scan-line algorithm by the Lisp Machine's hardware and software.

Degree

thesis:*
Grantor dc:publisher
University of North Texas
Year dc:date
1988

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Myjak, Michael D. (Michael David)
Contributors dc:contributor
  • Swigger, Kathleen M.
  • Conrady, Denis A.
  • Best, Margo Z.

Subjects

dc:subject × 6

Rights

dc:rights
Statement dc:rights
  • Public
  • Myjak, Michael D. (Michael David)
  • Copyright
  • Copyright is held by the author, unless otherwise noted. All rights reserved.
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
local-cont-no: 1002779182-Myjak
call-no: 379 N81 no. 6497
untcat: b1986898
oclc: 21250890
ark: ark:/67531/metadc500544

Chain of custody

source
Harvested from
University of North Texas
Base URL
digital.library.unt.edu/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Myjak, Michael D. (Michael David). Computer Graphics Primitives and the Scan-Line Algorithm. University of North Texas, 1988. https://digital.library.unt.edu/ark:/67531/metadc500544/