Shows a series of Euclidean equations using the Euclidean algorithm to get the greatest common divisor of two integers. Describes the use of the equations to generate a series of circles. Discusses computer generation of Euclidean circles and provides a BASIC program. (YP)

Described is computational geometry which used concepts and results from classical geometry, topology, combinatorics, as well as standard algorithmic techniques such as sorting and searching, graph manipulations, and linear programing. Also included are special techniques and paradigms. (KR)

Described is a computer algorithm for obtaining the coordinates of vertices, chord factors, and dihedral angles for plotting orthographic and axonometric projections, and for tabulating chord lengths and dihedral angles. (Author)

This document consists of the first two volumes of a new annual serial devoted to surveying some of the important developments in the mathematical sciences in the previous year or so. Mathematics is constantly growing and changing, reaching out to other areas of science and helping to solve some of the major problems facing society. Volumes 1 and…

This textbook was designed for a first course in differential and integral calculus, and is directed toward students in engineering, the sciences, mathematics, and computer science. Its major goal is to bring students to a level of technical competence and intuitive understanding of calculus that is adequate for applying the subject to real world…