Showing papers on "Computational geometry published in 1977"
TL;DR: An analysis of the computational geometry of finite-rank linear threshold machines reveals that the use of such machines as “general purpose pattern recognition systems” is severely limited.
Abstract: Linear threshold machines are defined to be those whose computations are based on the outputs of a set of linear threshold decision elements. The number of such elements is called the rank of the machine. An analysis of the computational geometry of finite-rank linear threshold machines, analogous to the analysis of finite-order perceptrons given by Minsky and Papert, reveals that the use of such machines as “general purpose pattern recognition systems” is severely limited. For example, these machines cannot recognize any topological invariant, nor can they recognize nontrivial figures “in context”.
6 citations
TL;DR: After defining a notation for a generalized representation for points in space, its relation to homogeneous coordinates is shown and the tree of the vector approach is developed for transformation, perspective and clipping.
4 citations
TL;DR: A numerical geometry system jointly implemented by IBM and Teledyne-Ryan Aeronautical in San Diego is discussed from a point of view at the mathematical and algorithmic levels.
Abstract: Three papers [3],[9],[11] have described a numerical geometry system jointly implemented by IBM and Teledyne-Ryan Aeronautical in San Diego. They devoted attention specifically to the overall program structure and system capabilities. The present paper discusses this system from a point of view at the mathematical and algorithmic levels.