The Grand Tour in k-Dimensions

Conference paper


The grand tour introduced by Asimov (1985) is based on the idea that one method of searching for structure in d-dimensional data is to “look at it from all possible angles,” more mathematically, to project the data sequentially in to all possible two-planes. The collection of two-planes in a d-dimensional space is called a Grassmannian manifold. A key feature of the grand tour is that the projection planes are chosen according to a dense, continuous path through the Grassmannian manifold which yields the visual impression of points moving continuously.

Of course, while the grand tour just described will reveal non-random two-dimensional structure, it may not be particularly helpful in isolating higher dimensional structure. We propose the k-dimensional grand tour in d-dimensions, where k ≤ d. We give basic algorithms for computing a continuous sequence through the Grassmannian manifold of k-flats. We use the k-dimensional parallel coordinate display to represent visually the projections of the data into k-flats.


Basis Vector Grassmannian Manifold Generalize Rotation Dynamic Graphic Rotate Coordinate System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Asimov, D. (1985), “The grand tour: a tool for viewing multidimensional data,” SIAM J. Sci. Statist Comput, 6, 128–143MathSciNetzbMATHCrossRefGoogle Scholar
  2. Buja, A. and Asimov, D. (1985), “Grand tour methods: an outline,” Computer Science and Statistics: Proceedings of the Seventeenth Symposium on the Interface, D. Allen, ed., Amsterdam: North Holland, 63–67Google Scholar
  3. Buja, A., Hurley, C. and McDonald, J. A. (1986), “A data viewer for multivariate data,” Computer Science and Statistics: Proceedings of the Eighteenth Symposium on the Interface, T. Boardman, ed., Alexandria, VA: American Statistical Association, 171–174Google Scholar
  4. Foley, J., van Dam, A., Feiner, S. and Hughes, J. (1990), Computer Graphics: Principles and Practice (2nd Edition), Reading, Mass.: Addison-WesleyGoogle Scholar
  5. Hurley, C. and Buja, A. (1990), “Analyzing high dimensional data with motion graphics,” SIAM J. Sci. Statist. Comput, 11, 1193–1111zbMATHCrossRefGoogle Scholar
  6. Kendall, M. G. (1961), A Course in the Geometry of n Dimensions, London: Charles Griffen and CompanyzbMATHGoogle Scholar
  7. Wegman, E. J. (1990), “Hyperdimensional data analysis using parallel coordinates,” J. Amer. Statist Assoc, 85, 664–675CrossRefGoogle Scholar
  8. Wegman, E. J. and Bolorforoush, M. (1990) Mason Hypergraphics, Fairfax Station, VA: Professional Statisticians Forum (MS-DOS software)Google Scholar

Copyright information

© Springer-Verlag New York, Inc. 1992

Authors and Affiliations

  1. 1.Center for Computational StatisticsGeorge Mason UniversityFairfaxUSA

Personalised recommendations