TY - GEN
T1 - CONVEXITY ALGORITHMS FOR PYRAMID COMPUTERS.
AU - Miller, Russ
AU - Stout, Quentin F.
PY - 1984
Y1 - 1984
N2 - Several pyramid computer algorithms are presented for deciding convexity, identifying extreme points of a convex hull, and using extreme points. For a pyramid computer with a base of n processing elements arranged in a square, the algorithms' times range from theta (log(n)) time to find the extreme points of a convex figure in the digitized picture, to theta (n**1 **/ **6 ) time to find the diameter of a figure, to theta (n**1 **/ **2 ) time to find, for each label, the extreme points of the processing elements with that label. The results show the sensitivity of efficient pyramid algorithms to the rate at which the essential data can be reduced, and also show that a wide variety of techniques are needed to make full and efficient use of the pyramid architecture.
AB - Several pyramid computer algorithms are presented for deciding convexity, identifying extreme points of a convex hull, and using extreme points. For a pyramid computer with a base of n processing elements arranged in a square, the algorithms' times range from theta (log(n)) time to find the extreme points of a convex figure in the digitized picture, to theta (n**1 **/ **6 ) time to find the diameter of a figure, to theta (n**1 **/ **2 ) time to find, for each label, the extreme points of the processing elements with that label. The results show the sensitivity of efficient pyramid algorithms to the rate at which the essential data can be reduced, and also show that a wide variety of techniques are needed to make full and efficient use of the pyramid architecture.
UR - https://www.scopus.com/pages/publications/0021538511
M3 - Conference contribution
AN - SCOPUS:0021538511
SN - 081860560X
T3 - Proceedings of the International Conference on Parallel Processing
SP - 177
EP - 184
BT - Proceedings of the International Conference on Parallel Processing
A2 - Keller, Robert M.
PB - IEEE
ER -