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.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc500544 |
| Date | 12 1900 |
| Creators | Myjak, Michael D. (Michael David) |
| Contributors | Swigger, Kathleen M., Conrady, Denis A., Best, Margo Z. |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | iv, 86 leaves: ill., Text |
| Rights | Public, Myjak, Michael D. (Michael David), Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved. |
Page generated in 0.0019 seconds