Share Email Print
cover

Proceedings Paper

Grand tour via geodesic interpolation of 2-frames
Author(s): Daniel A. Asimov; Andreas Buja
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Grand tours are a class of methods for visualizing multivariate data, or any finite set of points in n-space. The idea is to create an animation of data projections by moving a 2-dimensional projection plane through n-space. The path of planes used in the animation is chosen so that it becomes dense, that is, it comes arbitrarily close to any plane. One inspiration for the grand tour was the experience of trying to comprehend an abstract sculpture in a museum. One tends to walk around the sculpture, viewing it from many different angles. A useful class of grand tours is based on the idea of continuously interpolating an infinite sequence of randomly chosen planes. Visiting randomly (more precisely: uniformly) distributed planes guarantees denseness of the interpolating path. In computer implementations, 2-dimensional orthogonal projections are specified by two 1- dimensional projections which map to the horizontal and vertical screen dimensions, respectively. Hence, a grand tour is specified by a path of pairs of orthonormal projection vectors. This paper describes an interpolation scheme for smoothly connecting two pairs of orthonormal vectors, and thus for constructing interpolating grand tours. The scheme is optimal in the sense that connecting paths are geodesics in a natural Riemannian geometry.

Paper Details

Date Published: 4 April 1994
PDF: 9 pages
Proc. SPIE 2178, Visual Data Exploration and Analysis, (4 April 1994); doi: 10.1117/12.172065
Show Author Affiliations
Daniel A. Asimov, Computer Sciences Corp. at NASA Ames Research Ctr. (United States)
Andreas Buja, Bell Communications Research (United States)


Published in SPIE Proceedings Vol. 2178:
Visual Data Exploration and Analysis
Robert J. Moorhead; Deborah E. Silver; Samuel P. Uselton, Editor(s)

© SPIE. Terms of Use
Back to Top