Premium
Two simple windowing algorithms
Author(s) -
Jarvis John F.
Publication year - 1975
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380050202
Subject(s) - minicomputer , computer science , simple (philosophy) , division (mathematics) , algorithm , multiplication (music) , graphics , arithmetic , computer graphics (images) , mathematics , operating system , philosophy , epistemology , combinatorics
Two 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 smaller.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom