Problems with raster graphics algorithms

  • Wm. Randolph Franklin
Conference paper
Part of the EurographicSeminars book series (FOCUS COMPUTER)


Assorted unusual problems with raster graphics digitization or scan conversion algorithms, where the implementation is much harder than the concept, are considered. They include digitizing a line that is on a plane so that the line is always visible, and digitizing a subset of a line correctly. Raster graphics is harder than vector graphics, in a deep sense.


Remainder Function Float Point Number Float Point Arithmetic Vector Graphic Presburger Arithmetic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (Gentleman and Marovich, 1974).
    W.M. Gentleman and S.B. Marovich. “More on Algorithms That Reveal Properties of Floating Point Arithmetic Units”, Comm. ACM 17, (5), (May 1974), pp. 276–277.CrossRefGoogle Scholar
  2. (Malcolm, 1972).
    M.A. Malcolm, “Algorithms to Reveal Properties of Floating Point Arithmetic:, Comm. ACM 15, (11), (November 1972), pp. 949–951.CrossRefGoogle Scholar
  3. (Spiegel, 1963).
    M.R. Spiegel, Theory and Problems of Advanced Calculus, Schaum’s Outline Series, McGraw-Hill, New York, (1963).Google Scholar
  4. (Yasuhara, 1971).
    A. Yasuhara, Recursive Function Theory and Logic, Academic Press, New York, (1971).zbMATHGoogle Scholar

Copyright information

© EUROGRAPHICS The European Association for Computer Graphics 1986

Authors and Affiliations

  • Wm. Randolph Franklin
    • 1
  1. 1.Electrical, Computer, and Systems Engineering Dept.Rensselaer Polytechnic InstituteTroyUSA

Personalised recommendations