Tokyo / Kyoto / Athens / Detroit / Miami / London / Baltimore / St. Jovite / New York / /
Company
Columbia University Press / XEROX / JAI Press Inc. / /
Country
Netherlands / Canada / United Kingdom / Greece / /
Currency
pence / /
Facility
Oxford University / Cambridge University / University of Waterloo / Smith College / University of Tokyo / Technical University of Graz / Stanford University / University of Eindhoven / McGill University / /
North Atlantic Treaty Organization / School of Computer Science / Cambridge University / Columbia University / Technical University of Graz / Smith College / Robotic Intelligence / Stanford University / University of Tokyo / McGill University / University of Waterloo / Oxford University / University of Eindhoven / McGill University / Montreal / Pattern Analysis and Machine Intelligence / Department of Mechanical Engineering / /
Position
Prime Minister / chair / /
Product
Franklin / F117 / /
ProvinceOrState
Northampton / New York / Massachusetts / Michigan / /
PublishedMedium
IEEE Transactions on Pattern Analysis and Machine Intelligence / The American Mathematical Monthly / Theoretical Computer Science / Computer Graphics / Communications of the ACM / Mathematics Magazine / Theory of Computing / /
SportsLeague
Stanford University / /
TVShow
Q.E.D. 5 / /
Technology
hidden sphere algorithms / linear algorithm / Linear time algorithms / hidden sphere algorithm / linear programming algorithm / Image Processing / circle-reachability algorithm / /
[41] B. Chazelle, “The polygon containment problem”, in Computational Geometry, Ed., F. P. Preparata, Advances on Computing Research, vol. 1, JAI Press, Inc., 1983, pp[removed]]