Packing Lines, Planes, etc.: Packings in Grassmannian Spaces

Publisher Website
Google Scholar
Abstract
We addressthe question: How should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they are as far apart as possible? The resuIts of extensive computations for modest values of N, n, m are described, as well as a reformulation of the problem that was suggested by these computations. The reformulation gives a way to describe n-dimensional subspaces of m-space as points on a sphere in dimension ½(m–l)(m+2), which provides a (usually) lowerdimensional representation than the Plücker embedding, and leads to a proof that many of the new packings are optimal. The results have applications to the graphical display of multidimensional data via Asimov's grand tour method.

This publication has 24 references indexed in Scilit: