Two simple windowing algorithms

摘要

AbstractTwo algorithms that solve the frequently occurring problem in computer graphics, windowing, are described. The primary distinction between the two algorithms is the need for multiplication and division in one of them. The algorithms are compared for running time and size on two commonly used minicomputer systems, the Digital Equipment Corporation PDP‐9/15 and PDP‐11. Not surprisingly the algorithm incorporating the extended arithmetic capability executes faster and the PDP‐11 versions are substantially sm