A Review of Temporal Data Visualizations Based On Space-Time Cube Operations
A Review of Temporal Data Visualizations Based On Space-Time Cube Operations
1 INRIA, France
2 Swansea University, UK
3 ENAC, France
4 University of Calgary, Canada
Abstract
We review a range of temporal data visualization techniques through a new lens, by describing them as series of op-
erations performed on a conceptual space-time cube. These operations include extracting subparts of a space-time
cube, flattening it across space or time, or transforming the cube’s geometry or content. We introduce a taxonomy
of elementary space-time cube operations, and explain how they can be combined to turn a three-dimensional
space-time cube into an easily-readable two-dimensional visualization. Our model captures most visualizations
showing two or more data dimensions in addition to time, such as geotemporal visualizations, dynamic networks,
time-evolving scatterplots, or videos. We finally review interactive systems that support a range of operations. By
introducing this conceptual framework we hope to facilitate the description, criticism and comparison of existing
temporal data visualizations, as well as encourage the exploration of new techniques and systems.
Categories and Subject Descriptors (according to ACM CCS): H.5.0 [Information Systems]: Information Interfaces
and Presentation—General
8
Inflation (%)
8
Inflation (%)
8 8
Inflation (%)
Inflation (%)
6 6 6 6 6
00
90 4
90
4 4 4 have been employed in a number of interactive visualization
92
systems (e.g., [CCT∗ 99, FLM00, Kra03]), as well as for en-
2 2 92 2 2 2
98 96 94 94
0 0 98 0 0 0
96 00
-2
0 10 20
Unemployment rate (%)
-2
0 10 20
Unemployment rate (%)
-2
0 10 20
Unemployment rate (%)
-2
0 10 20
Unemployment rate (%)
-2
0 10 20
Unemployment rate (%)
tertainment purposes [CI05] (see Figure 4). However, they
France Spain 1996 1998 2000 have never been used as a conceptual model for reflecting
8
Inflation (%)
8 8 8
Inflation (%)
Inflation (%)
Inflation (%)
90 92
6 6 6 6 6
4
90 4 94 4 4 4
00
92 96
2 96 2 98 2 2 2
00 94
0 98 0 0 0 0
-2 -2 -2 -2 -2
0 10 20 0 10 20 0 10 20 0 10 20 0 10 20
Unemployment rate (%) Unemployment rate (%) Unemployment rate (%) Unemployment rate (%) Unemployment rate (%)
2. A space-time cube does not need to involve spa- 2.1. Time Cutting
tial data. Many visualizations (e.g., scatterplots, bar charts
or node-link diagrams) convey abstract, non-spatial data 1 2
[Mun08]. Nevertheless, they all occupy a 2D space. When
data changes over time, such as in GapMinder’s animated
2D scatterplots [Ros06], each animation frame can be con-
ceptually thought of as a slice of a space-time cube. In the
term space-time cube, space therefore refers to an abstract Time
2D substrate that is used to visualize data at a specific time.
Figure 5: The time cutting operation.
Thus it is important to stress that this article is not about
space-time cube visualizations, and that 3D space-time cube
A time cutting operation consists in extracting a particu-
representations like the one in Figure 3 only represent a very
lar temporal snapshot from the cube to be presented to the
small subset of the techniques we aim to cover.
viewer. Figure 5 illustrates this operation: the left part (1)
In addition, our conceptual framework does not consider shows the initial space-time cube and the temporal snapshot
how space-time cubes are built, e.g., whether or not 2D scat- that is being extracted, while the right part (2) shows the re-
terplots should be used to represent the value of country in- sulting image that is presented to the viewer.
dicators at any given time. Instead, it assumes that a con- For example, consider a photographer who captures a par-
ceptual 3D space-time cube is already given, and focuses ticular instant of a moving scene. If the scene being viewed
on how this cube can be transformed to accommodate 2D is represented as a space-time cube (i.e., all possible pictures
media like computer displays and paper while remaining are piled up to form a cube), then taking a photograph is
legible. We show how such transformations are enough to equivalent to applying a time cutting operation on this cube.
capture most known techniques for visualizing rich tempo-
ral datasets. We mostly focus on datasets that involve two In information visualization, an image produced by time
dimensions plus time (e.g., spatio-temporal data, dynamic cutting is typically called a time slice. But a temporal visual-
graphs, scatterplots, videos, or any two-dimensional numer- ization rarely consists in a single time slice. As we will see
ical data varying over time), although we later discuss how in Section 3, time cutting is typically either performed mul-
our model can be extended to other dimensionalities. tiple times and used in combination with other operations, or
is used in combination with animation and interaction.
We first review common temporal data visualization tech-
niques, and explain how they can be all seen as operations on
a conceptual space-time cube. We then describe our frame- 2.2. Time Flattening
work in more detail by providing definitions of key concepts,
1 2
as well as a taxonomy of elementary operations and how
they can be combined. We then review temporal data explo-
ration systems that show how a range of space-time cube op-
erations can be supported on a single system through inter-
activity. Finally, we discuss the limitations of our framework Time
and suggest avenues for future work.
Figure 6: The time flattening operation.
Spain
8
90 92
6 91 93
Inflation (%)
96 94
00 97
4
95
2 99 98 Figure 10: An example of discrete time flattening. For a bet-
0 ter infographic by Megan Jaegerman, see [Tuf].
-2
0 10 20
Unemployment rate (%) Tufte [Tuf86] comments on several examples of info-
(a) (b) graphics that employ discrete time flattening. He calls them
sequences. One of his famous examples is the life cycle of
Figure 8: Other examples of time flattening: (a) Detail of the
the Japanese beetle [Tuf86]. Figure 10 is a sequence show-
map of the cholera outbreak in London 1854, by Dr. John
ing a dancer’s move. Discrete time flattening has also been
Snow. Piled bars mark the number of death per house. (b)
used for summarizing videos [BDH04].
Connected scatterplot showing the relationship between in-
flation rate and unemployment in Spain from 1990 to 2000.
2.4. Colored Time Flattening
Many maps that show temporal data can be seen as time-
flattened space-time cubes. But the time flattening technique 1 2 3
is not limited to geographical data, and has been employed in
a large variety of information visualization systems as well
as in static data graphics. Figure 8(b) for example, shows the
evolution of inflation rate and unemployment in Spain from
Time
1990 to 2000. This diagram can be seen as time-flattened Time
2.3. Discrete Time Flattening The colored time flattening operation is similar to the
time flattening operation, but time slices are assigned a color
1 2 3
before being combined (Figure 11). Although this opera-
tion does not map to any photography technique we know
of, similar results could in principle be obtained by rapidly
switching color filters during a long-exposure photography.
(a) (b)
1 2
Time
Time
Time
Figure 18: The space flattening operation.
Figure 21: The sampling operation.
Space flattening is similar to space cutting, but involves
flattening the cube along a particular direction on the data Sampling is a more complex operation that consists in ex-
plane instead of extracting a cut (see Figure 18). tracting space cuts (samples) from a space time cube at sev-
eral locations on the data plane, then rotating those samples
An example of use of space flattening in infovis is the in-place so they face the viewer (Figure 21).
History Flow technique for visualizing document histo-
ries [VWD04], illustrated in Figure 19: the right panel shows Two examples of sampling are mentioned in this article’s
the last revision of a Wikipedia article, each color corre- introduction (Figure 1). The top one shows the evolution of
sponding to a specific contributor. The left visualization crime statistics in every US state [AA04b], while the bot-
shows the history of the article, built by collapsing each ar- tom one shows the evolution of high school population in
ticle revision into a one-pixel column, and then displaying several districts across three years [SRdJ05]. Although addi-
all columns side-by-side. These operations are equivalent to tional operations are involved (e.g., using silhouette graphs
flattening the article’s space-time cube along the x data axis. to encode values), both examples are conceptually based on
a sampling operation. Sampling has also been used in dy-
namic network visualization, for conveying changes in edge
weight [BN11] and in attribute values [HSCW13].
2.9. 3D Rendering
Time
3D rendering is essentially a flattening operation but in The ultimate goal of space-time cube operations is to
contrast with time flattening and space flattening, it is (i) transform a space-time cube into a space-time object whose
typically done on a plane not orthogonal to the cube’s princi- shape is compatible with the shape of the media employed
pal axes; (ii) can involve a non-orthographic projection (e.g., to convey the information. By media we mean the visual-
perspective projection); (iii) can involve 3D shading, i.e. the ization’s physical presentation, which is the physical object
addition of light reflections and shadows. or apparatus that makes a visualization observable to the
viewer [JD13]. In the vast majority of cases (i.e. computer
displays and paper) the media has a planar shape.
For a given media, a space-time cube operation is com-
plete if it takes space-time volumes as input and produces
space-time objects whose shape match the media’s shape.
Otherwise the operation is incomplete: it cannot be used to
produce a valid visualization from a space-time cube. Sev-
eral elementary space-time cube operations can be chained,
in which case they form compound operations. A compound
operation is complete if the first operation takes space-time
(a) (b) volumes as input, and the last operation produces space-time
objects whose shape is compatible with the media.
Figure 23: Two examples of 3D rendering. (a) Occurrence of
earthquakes (authors’ illustration after [GAA04]), and (b) a
dynamic Network [DG04] 3.2. A Taxonomy of Elementary Space-time cube
operations
A taxonomy of elementary space-time cube operations is
In geography and geology, 3D rendering has been used shown in Figure 24 on the next page. The taxonomy breaks
to visualize events such as earthquakes (Figure 23(a)) or the down space-time cube operations into five main classes:
movement of objects [Kra03, GAA04]. 3D rendering is also
common in temporal information visualization. For exam- • Extraction consists in selecting a subset of a space-time
ple, in networks whose connectivity change over time, nodes object (e.g., extracting a line or cut from a volume),
can be represented as columns and links as bridges [DG04, • Flattening consists in aggregating a space-time object into
BC03] (Figure 23(b)). When the layout of the dynamic net- a lower-dimensional space-time object (e.g., projecting a
work also changes, nodes become worms [DE02, GHW09]. volume onto a surface),
• Filling consists in turning a set of disconnected space-
time objects into a fully connected space-time object,
3. The Design Space of Space-Time Cube Operations • Geometry transformation consists in transforming a
The previous section reviewed several common operations space-time object spatially without change of content,
that turn a conceptual time-space cube into a final two- • Content transformation consists in changing the content
dimensional visualization. Those were examples selected for of a space-time object without affecting its geometry.
illustration, and the list was not meant to be exhaustive. In The table in Figure 24 shows how general operations
addition, some operations were rather simple (e.g., time cut- break down into more specific operations. On each of the
ting), while others were more complex (e.g., sampling) and two columns, general operations are on the left while more
could be described as a composition of several lower-level specific operations are on the right. Operations that are the
operations. Therefore, we provide in this section a more sys- most specialized (i.e. leaves on the taxonomy tree) are shown
tematic description of the design space of space-time cube on a white background. Operations written in bold are those
operations. which produce planar surfaces, i.e. can be used as final op-
erations on screen-based and paper-based media.
3.1. Basic Terminology We quickly review the most specialized operations (white
background), going from top to bottom on the left column,
A space-time cube operation takes a space-time object and then on the right column. We also describe the parameters
produces another space-time object. A space-time object is necessary to specify each space-time cube operation. Most
a geometrical object within a space-time coordinate system of the operations have already been used in infovis, others
(i.e. two spatial dimensions and one temporal dimension). have been added for completeness.
Possible space-time objects include (i) space-time volumes
• Extraction:
(of which a complete space-time cube is an example), (ii)
space-time surfaces (planar and non-planar), (iii) space-time – Point extraction consists in selecting a specific point
curves, (iv) points, as well as (v) sets of disconnected vol- inside a space-time volume. This operation is defined
umes, surfaces, curves and points. by a 2D position on the data plane and a time value.
Filling
Time Space
Orthogonal
Interpolation Interpolation
Drilling Time Space
Planar Drilling Drilling
Volume Interpolation
Drilling
Curve Oblique Drilling
Planar Translation
Curvilinear Drilling Time Space
Shiting Shiting
Non-Planar Drilling Rigid
Transfor-
Geometry Transformation
Yaw
mation
Rotation
Orthogonal Pitch
Cutting Time
Planar Linear Space
Cutting Cutting Roll
Cutting
Extraction
Orthogonal
Chopping
Planar Time Linear Space
Chopping Chopping Chopping Time Space
Coloring Coloring
Recoloring
Diference
Curvilinear Coloring
Content Transformation
Stabilizing
Orthogonal Repositioning
Flattening
Flattening
Planar Bundling
Flattening Time Space
Flattening Flattening
Shading
Oblique Flattening
Filtering
Figure 24: Taxonomy of elementary space-time cube operations with schematic illustrations. Gray shading indicates non-
leaves, bold indicates complete operations. The Time column regroups operations that are applied according to the time axis,
while the Space column regroups operations that are applied according to the data plane.
submitted to Eurographics Conference on Visualization (EuroVis) (2014)
B. Bach & P. Dragicevic / A Review of Temporal Data VisualizationsBased on Space-Time Cube Operations 9
– Time drilling consists in extracting a line parallel with This operation takes as parameters a time value, a
the time axis. It is uniquely specified by a 2D position projection function and an aggregation function. The
on the data plane. For example, sampling (Section 2.8) projection function maps 3D points to points on the
uses several drilling operations. plane. Examples include orthographic projection and
– Space drilling extracts a line perpendicular with the perspective projection. The aggregation function de-
time axis. It is specified by a 2D line and a time value. scribes how point values are combined. If values are
– Oblique drilling consists in extracting an arbitrarily defined in an RGBA color space, the function maps
oriented straight line from within a space-time volume. vectors of RGBA colors to a single RGBA color. Ex-
– Planar curvilinear drilling consists in extracting a amples of such functions include alpha-blending (e.g.,
planar 3D curve from a space-time volume. This op- averaging all colors) and overplotting (i.e. only keep-
eration, as well as all operations above, is complete ing the last color).
for 2D media. – Space flattening, oblique flattening and non-planar
– Non-planar curvilinear drilling consists in extract- flattening are similar operations, but the surface on
ing an arbitrary 3D curve from a space-time volume. which the volume is projected is different (see previ-
It is incomplete, and hence needs to be combined ous cutting operations as well as Sections 2.7 and 2.9
with other operations like flattening or unfolding. This for more details).
operation can be used to extract object trajectories
• Filling:
[KW04, RFF∗ 08].
– Time cutting consists in extracting a planar cut from – Time interpolation consists in filling “holes” in
a space-time volume in a direction orthogonal to the space-time objects (volumes, surfaces or curves) by
time axis (see Section 2.1). It takes as parameter a time interpolating between values along the time axis. It
value that defines the cut position on the time axis. It takes as parameter a monovariate interpolation func-
is a complete operation for 2D media. tion. For example, a piecewise linear time interpola-
– Linear space cutting consists in extracting a planar tion operation will transform a set of time slices into a
cut from a space-time volume in a direction orthogonal full space-time cube by linearly interpolating the val-
to the data plane (see Section 2.6). It is also complete, ues (e.g., RGBA colors) between pairs of successive
and takes as parameter a line or a segment parallel to time slices.
the data plane that once extruded over time defines the – Space interpolation consists in filling “holes” in
cutting surface. space-time objects by interpolating between values on
– Oblique cutting consists in extracting a planar cut each data plane. It takes as parameter a bivariate inter-
from a space-time volume that is neither orthogonal polation function. For example, a bilinear space inter-
to the time axis, nor orthogonal to the data plane (e.g. polation operation will transform a set of lines parallel
[FLM00]). It takes as parameter a 3D cutting plane. to the time axis into a full space-time cube.
– Curvilinear space cutting is similar to linear space – Volume interpolation consists in filling “holes” in
cutting except the cutting surface is produced by ex- space-time objects by interpolating across both space
truding a curve parallel to the data plane that is nei- and time. It takes as parameter a trivariate interpolation
ther a line nor a segment. This operation produces function. One example is interpolating video frames
non-planar space-time surfaces that further need to be using motion estimation techniques [CLK00].
flattened (e.g., using 3D rendering [TSAA12]) or un-
• Geometry Transformation:
folded (as in Figure 16).
– Time chopping is similar to time cutting but slices – Space shifting, time shifting, yaw, roll and pitch
have a thickness instead of being infinitely thin. Since consist in moving or rotating space-time objects. They
it produces volumes it is not complete for 2D media, can be used, e.g., for placing multiple cuts side-by-side
and thus needs to be complemented with additional op- or for rotating an entire space time cube rendered in
erations. It takes as parameter a time segment that de- 3D (e.g. [KW04,CCT∗ 99,BPF14b]). They each take a
fines the two cutting slabs (a slab is the infinite region single scalar value as parameter.
between two planes). – Time scaling and space scaling rescale space-time
– Linear space chopping, oblique chopping and objects along their principal axes. They take as param-
curvilinear space chopping are similar to the previ- eters one and two scalar values respectively, that define
ous cutting operations, with the difference that they the scaling factor.
produce volumes with a certain thickness instead of – Bending deforms space-time objects. For example, a
infinitely thin surfaces. space-time volume can be bent such that the time axis
follows an arc instead of a line [DC03]. This operation
• Flattening:
takes as parameter a deformation function that maps
– Time flattening aggregates a space-time volume into 3D locations to 3D locations.
a plane orthogonal to the time axis (see Section 2.2). – Unfolding transforms a non-planar space-time surface
into a planar space-time surface. An analogy is a map tive video fast-forward [PJH05]. Similarly, an unfolding op-
projection function that transforms a sphere or portion eration that works on any surface (as opposed to, e.g., only
of sphere into a plane. An example of space-time un- spheres), would be an adaptive unfolding operation.
folding is Maray’s train schedule (Figure 16), which
Semantic operations take into account the data seman-
can be seen as an unfolded curvilinear space cut per-
tics of the space-time objects they operate on. One exam-
formed on a time-evolving 2D map.
ple would be a semantic volume interpolation operation that
• Content Transformation: connects discrete sets of moving objects with lines or tubes
(see Figures 8(b) and 23(b), as well as [Ros06, BPF14a]).
– Time coloring consists in altering the colors of each
This type of operation is semantic because it needs to know
time slice according to time. Examples include col-
the identity of the objects to be able to match them on suc-
oring each time slice uniformly according to a linear
cessive time slices. Time labeling operations such as the one
color scale (Figure 12), changing the hue of each time
used in Figure 8(b) are also semantic, because they need to
slice, or dividing the time axis in different regions and
know the location of datapoints of interest to place the labels
applying a discrete color scale (Figure 7).
appropriately. Filtering operations can also be semantic, as
– Space coloring alters the color of points in a space-
well as recoloring operations [VWD04, RFF∗ 08, BPF14b].
time volume depending on their 2D position on the
Finally, semantic operations can also be used to cut cubes
data plane.
according to specific temporal cycles (days, weeks, etc.).
– Difference coloring consists in altering the colors
of each time slice according to the difference be-
tween time slices. One example is highlighting ap-
3.4. Compound Operations
pearing nodes and disappearing nodes in a dynamic
graph [RM13, BPF14a]. We previously defined compound operations as several oper-
– Time labeling consists in adding time labels to each ations applied in sequence. According to our taxonomy from
time slice or to objects inside a space-time volume Figure 24, some of the operations we introduced in Section
(Figure 8(b)). 2 are elementary, namely time cutting, time flattening, space
– Stabilizing consists in repositioning objects on each flattening. Others are compound and can be broken down as
data plane so that their trajectories are as parallel as indicated in Table 1. In our notation, the symbol + refers to a
possible to the time axis. Examples include comput- composition, the symbol ∗ refers to operations applied mul-
ing stable layouts for dynamic networks [AP12a] and tiple times and the symbols [ ] refer to optional operations.
stabilizing videos [BGPS07].
– Bundling consists in repositioning objects on each
Compound Operation Elementary Operations
data plane in order to bring their trajectories closer to
Discrete time flattening time cutting* + time flattening
each other. One example is bundling air plane routes
Colored time flattening time coloring + time flattening
[HEF∗ 13].
Time juxtaposing (time cutting + space scaling + space
– Shading consists in altering the color of a space- shifting)* + time flattening
time volume’s content by simulating light propagation Marey’s schedule curvilinear space cutting + yaw + un-
mechanisms (e.g., diffusion, specular reflection, drop folding
shadows). Slit tears (linear/curvilinear space cutting +
– Filtering consists in removing parts of a space-time yaw + [unfolding] + space shifting)*
volume’s content. One example is removing all points Sampling (time drilling + time scaling + yaw)*
of a certain color or value [CCT∗ 99, DC03, BPF14b]. 3D rendering [shading] + oblique flattening
– Aggregation replaces multiple space-time objects by
Table 1: Compound operations decomposed.
a single, larger space-time object. Different methods
exist. For example, 3D kernel density estimation trans-
forms a set of space-time points or space-time curves
A compound operation inherits the parameters of its sub-
into 3D volumes or 2D (iso) surfaces [DV10].
operations. For example, a discrete time flattening operation
is specified by a sequence of time values, as well as a pro-
3.3. Adaptive and Semantic Operations jection function and an aggregation function. But in practice,
most compound operations enforce constraints between their
So far we mostly described operations that are agnostic to the
parameters. For example, all space scalings from a time jux-
data and the content of the cube. Adaptive operations take
taposing operation are typically the same.
into account the shape or content of the particular space-time
objects they operate on. For example, an adaptive time cut- Many elaborate temporal data visualization techniques
ting operation can be used to cut cubes according to regions can be described as compound operations. For example, the
with large changes instead of cutting them into regularly- Visits technique (Figure 25) employs (time chopping + time
spaced slices. This technique is used, for example, in adap- flattening + space shifting)*.
3.5.2. Interaction
Figure 25: Compound operation in Visits [TBC13]. Interaction is similar to animation except the changes in the
space-time cube operations are under the user’s control.
3.5. Dynamic Operations Consider animated time cutting: if the position of the cut-
ting plane is controlled by the user (e.g., by dragging a
So far we only considered operations (both elementary and slider) instead of being automatically moved, then the op-
compound) that transform a space-time cube into a static vi- eration becomes interactive time cutting. A common imple-
sual representation. On computer displays, operations can mentation of interactive time cutting is the seeker bar on a
also be applied in a dynamic manner. Dynamic operations video player. As with animations, any operation can be made
can involve either animation or interaction. interactive. Examples of interactive operations abound, and
we will review some of them in the next section.
3.5.1. Animation
We refer to animation as the process of applying different 4. Space-Time Cube Systems
operations on a space-time cube over time, or similarly, vary- Choosing an appropriate space-time cube operation depends
ing the parameters of an operation over time. on many factors and almost always involves tradeoffs. In this
The most common form of animation consists in changing section we review a representative sample of visualization
the position of a cutting operation over time, i.e. animated systems that address this issue by supporting multiple space-
time cutting. This results in the space-time cube content be- time cube operations. Such systems almost invariably use
ing “played back”. For example, if the space-time cube rep- 3D rendering as an explicit representation of the space time
resents a visual scene like video surveillance data, synchro- cube, both for showing an overview and for explaining how
nizing the motion of the slice with a clock will result in a different operations relate. We call these systems space-time
real-time playback of the original scene. When significant cube systems. Because they work by letting people switch
data is skipped during playback, the animation is closer to a between different operations and tune their parameters, in-
discrete time juxtaposing operation, except slices are shown teraction is a key feature.
in sequence instead of being laid out side-by-side.
An animated time cutting operation can be preceded by a 4.1. CommonGIS
filling operation in order to produce smooth animated tran-
sitions. Many examples exist in the literature, for exam-
ple when animating dynamic networks [ATMS∗ 11, RM13,
BPF14a] or scatterplots [Ros06, RFF∗ 08]. Most of these ex-
amples can be described as semantic volume interpolation
+ animated time cutting operations. Animated time cutting
can also be combined with other space-time cube operations
such as time flattening. For example, Gapminder can com-
bine scatterplot animations with static trails for points of in-
terest (a filtering + time flattening operation) [Ros06].
While many animation techniques can be described as an-
Figure 26: CommonGIS [AA99] (picture from [AA04a])
imated time cutting on static space-time cubes, more elabo-
rate techniques require operations to be applied in real-time.
CommonGIS [AA99] is a feature-rich analytical system
For example, Hurter et al.’s system [HEF∗ 13] uses animated
for spatio-temporal data. It supports several space-time cube
time chopping to animate a network over time while preserv-
operations, including time flattening and 3D rendering (Fig-
ing temporal context information. At every animation frame,
ure 26). The 3D rendering view is combined with a semantic
a time flattening is applied that produces colored trails and
filtering operation to make the space-time cube transparent:
a dynamic bundling operation is applied that guarantees a
geographical context is only shown on a single time slice, as
continuous animation without jumping bundles [HET12].
a reference plane. Two widgets provide control of the projec-
Although animated time cutting and its many variants are tion function (arrow in Figure 26). One controls the camera
the most common forms of animation, other animated op- position around the cube, the other one controls its height.
10:00
10:00
rotation)*) or apply a 3D fisheye effect (interactive (volume
extraction + translation)*). This fisheye effect, called “Vi-
08:00
08:00 N
4.4. VISUAL-TimePAcTS
(a) 3D rendering (b) Space flattening (on top)
4.3. Tardis Figure 29: VISUAL TimePAcTS [VFC10]. (a) Space Flat-
tening on activities, (b) Oblique flattening, (c) Space flatten-
ing on individuals.
By introducing domain-agnostic concepts and a clear ter- [AAB∗ 11] A NDRIENKO G., A NDRIENKO N., BAK P., K EIM D.,
K ISILEVICH S., W ROBEL S.: A Conceptual Framework and
minology, this article aims at facilitating the comparison of Taxonomy of Techniques for Analyzing Movement. Journal of
different approaches for visualizing temporal data. Exist- Visual Languages and Computing 22, 3 (June 2011), 213–232. 1
ing visualizations from one data domain can be analyzed in [AABW12] A NDRIENKO G., A NDRIENKO N., B URCH M.,
terms of elementary operations and then be adapted to other W EISKOPF D.: Visual analytics methodology for eye movement
domains and problems. studies. Visualization and Computer Graphics, IEEE Transac-
tions on 18, 12 (Dec 2012), 2889–2898. 15
By giving a better vision of the richness of the design [AAH11] A NDRIENKO G., A NDRIENKO N., H EURICH M.: An
space, we hope our model will also motivate the exploration Event-based Conceptual Model for Context-aware Movement
of new approaches. It also stresses the importance of devel- Analysis. International Journal on Geographic Information Sci-
oping fully-integrated interactive systems and toolkits that ence 25, 9 (Sept. 2011), 1347–1370. 1
can support a range of techniques in a consistent manner. [AMM∗ 07] A IGNER W., M IKSCH S., M ÜLLER W., S CHU -
MANN H., T OMINSKI C.: Visualizing Time-oriented data-A
Our model also aims at facilitating the design of studies Systematic View. Computers and Graphics 31, 3 (June 2007),
and discussing their results in a more informative manner. 401–409. 1
We hope the presented terminology and low-level concepts [AMST11] A IGNER W., M IKSCH S., S CHUMANN H., T OMIN -
SKI C.: Visualization of Time-Oriented Data, 1st ed. Human-
will help design better experiments that tease out important
Computer Interaction. Springer Verlag, 2011. 1, 14
factors in dynamic data visualization. Many more controlled
studies are needed to understand the trade-offs between dif- [AP12a] A RCHAMBAULT D., P URCHASE H. C.: Mental Map
Preservation Helps User Orientation in Dynamic Graphs. In Pro-
ferent space-time cube operations and how they perform de- ceedings of Graph Drawing (2012), GD ’12, Springer, pp. 475–
pending on the task, the data, and the people that use them. 486. 10
This work mostly arose out of the need to teach temporal [AP12b] A RCHAMBAULT D., P URCHASE H. C.: The Mental
Map and Memorability in Dynamic Graphs. In Proceedings of
information visualization to undergrad students. We there- Pacific Visualization Symposium (2012), PacificVis ’12, IEEE
fore hope that it will help other people teach this field effec- Computer Society, pp. 89–96. 15
tively, by providing a clear structure and a clear terminology [APP11] A RCHAMBAULT D., P URCHASE H., P INAUD B.: An-
on which to base higher-level discussions and analyses. imation, Small Multiples, and the Effect of Mental Map Preser-
vation in Dynamic Graphs. IEEE Transactions on Visualization
and Computer Graphics 17, 4 (2011), 539–552. 15
[arc] ArcGIS. http://www.esri.com/software/
Acknowledgements arcgis. [online, accessed:02-apr-2014]. 13
Collaboration on this work was initiated by Dagstuhl Semi- [AS] A RIS A., S HNEIDERMAN B.: NVSS: Network Visualiza-
tion by Semantic Substrates. http://www.cs.umd.edu/
nar “Putting Data on the Map 12261”, June 2012, and sup- hcil/nvss/. [online, accessed:02-apr-2014]. 6
ported in part by NSERC, SMART Technologies, AITF,
[ATMS∗ 11] A HN J.-W., TAIEB -M AIMON M., S OPAN A.,
Surfnet and GRAND NCE, as well as by Clique Strate- P LAISANT C., S HNEIDERMAN B.: Temporal visualization of
gic Research Cluster funded by Science Foundation Ireland social network dynamics: prototypes for nation of neighbors. In
(SFI) Grant No. 08/SRC/I1407. Proceedings of International conference on Social computing,
behavioral-cultural modeling and prediction (Berlin, Heidelberg, WAMPLER K.: A system for graph-based visualization of the
2011), SBP’11, Springer-Verlag, pp. 309–316. 11 evolution of software. In Proceedings of ACM Symposium on
Software Visualization (New York, NY, USA, 2003), SoftVis ’03,
[BB95] BAKER M. P., B USHELL C.: After the storm: Consid-
ACM, pp. 77–ff. 4, 5
erations for information visualization. Computer Graphics and
Applications, IEEE 15, 3 (1995), 12–15. 14 [CLK00] C HOI B.-T., L EE S.-H., KO S.-J.: New frame rate up-
conversion using bi-directional motion estimation. IEEE Trans-
[BBL12] B OYANDIN I., B ERTINI E., L ALANNE D.: A Qualita-
actions on Consumer Electronics 46, 3 (2000), 603–609. 9
tive Study on the Exploration of Temporal Changes in Flow Maps
with Animation and Small-Multiples. Computer Graphics Forum [CMS99] C ARD S. K., M ACKINLAY J. D., S HNEIDERMAN B.
31, 3pt2 (2012), 1005–1014. 5 (Eds.): Readings in Information Visualization: Using Vision to
Think. Morgan Kaufmann Publishers Inc., San Francisco, CA,
[BC03] B RANDES U., C ORMAN S. R.: Visual unrolling of net- USA, 1999. 13
work evolution and the analysis of dynamic discourse. Informa-
tion Visualization 2, 1 (Mar. 2003), 40–50. 7 [DC03] DANIEL G., C HEN M.: Video Visualization. In Proceed-
ings of IEEE Visualization (Washington, DC, USA, 2003), VIS
[BCD∗ 12] B ORGO R., C HEN M., DAUBNEY B., G RUNDY E., ’03, IEEE Computer Society, pp. 409–416. 9, 10, 13
H EIDEMANN G., H ÖFERLIN B., H ÖFERLIN M., L EITTE H.,
W EISKOPF D., X IE X.: State of the Art Report on Video-Based [DE02] DWYER T., E ADES P.: Visualising a Fund Manager Flow
Graphics and Video Visualization. Computer Graphics Forum Graph with Columns and Worms. In Proceedings of Interna-
31, 8 (Dec. 2012), 2450–2477. 1 tional Conference on Information Visualisation (2002), IV ’02,
pp. 147–152. 7
[BCH07] B RUNSDON C., C ORCORAN J., H IGGS G.: Visualis-
ing space and time in crime patterns: A comparison of methods. [DG04] DWYER T., G ALLAGHER D. R.: Visualising changes in
Computers, Environment and Urban Systems 31, 1 (2007), 52 – fund manager holdings in two and a half-dimensions. Informa-
75. Extracting Information from Spatial Datasets. 15 tion Visualization 3, 4 (Dec. 2004), 227–244. 7
[BDH04] BARTOLI A., DALAL N., H ORAUD R.: Motion [DJ13] D RAGICEVIC P., JANSEN Y.: List of Physical Visualiza-
Panoramas. Computer Animation and Virtual Worlds, 15 (2004), tions. http://www.tinyurl.com/physvis, 2013. [On-
501–517. 4 line; accessed 04-Sep-2013]. 14
[BGPS07] BATTIATO S., G ALLO G., P UGLISI G., S CELLATO [DV10] D EMŠAR U., V IRRANTAUS K.: Space–time density
S.: SIFT features tracking for video stabilization. In Proceedings of trajectories: exploring spatio-temporal patterns in movement
of Conference on Image Analysis and Processing (2007), ICIAP data. International Journal of Geographical Information Science
’07, IEEE, pp. 825–830. 10 24, 10 (2010), 1527–1542. 10
[FBS06] FALKOWSKI T., BARTELHEIMER B., S PILIOPOULOU
[BN11] B RANDES U., N ICK B.: Asymmetric Relations in Lon-
M.: Mining and Visualizing the Evolution of Subgroups in Social
gitudinal Social Networks. IEEE Transactions on Visualization
Networks. In Web Intelligence, 2006. WI 2006. IEEE/WIC/ACM
and Computer Graphics 17, 12 (Dec. 2011), 2283–2290. 6
International Conference on (2006), pp. 52–58. 6
[BPF14a] BACH B., P IETRIGA E., F EKETE J.-D.: GraphDi- [Fek04] F EKETE J.: The infovis toolkit. In Information Visual-
aries: Animated Transitions and Temporal Navigation for Dy- ization, 2004. INFOVIS 2004. IEEE Symposium on (2004), IEEE,
namic Networks. IEEE Transactions on Visualization and Com- pp. 167–174. 14
puter Graphics (2014). to appear. 5, 10, 11
[FLM00] F ELS S., L EE E., M ASE K.: Techniques for Interactive
[BPF14b] BACH B., P IETRIGA E., F EKETE J.-D.: Visualiz- Video Cubism (poster session). In Proceedings of International
ing Dynamic Networks with Matrix Cubes. In Proceedings of conference on Multimedia (New York, NY, USA, 2000), MUL-
SIGCHI Conference on Human Factors and Computing Systems TIMEDIA ’00, ACM, pp. 368–370. 2, 9, 13
(New York, NY, USA, 2014), CHI ’14, ACM. to appear. 9, 10,
11, 13, 14, 15 [FQ11] FARRUGIA M., Q UIGLEY A.: Effective temporal graph
layout: A comporative stydy of animations versus statuc display
[BVB∗ 11] B URCH M., V EHLOW C., B ECK F., D IEHL S., methods. Information Visualization (2011), 47–64. 15
W EISKOPF D.: Parallel Edge Splatting for Scalable Dynamic
Graph Visualization. Visualization and Computer Graphics, [GAA04] G ATALSKY P., A NDRIENKO N., A NDRIENKO G.: In-
IEEE Transactions on 17, 12 (2011), 2344–2353. 6 teractive Analysis of Event Data Using Space-Time Cube. In
Proceedings of the Information Visualisation, Eighth Interna-
[CCT∗ 99] C ARPENDALE S. T., C OWPERTHWAITE D. J., tional Conference (Washington, DC, USA, 2004), IV ’04, IEEE
T IGGES M., FALL A., F RACCHIA F. D.: The Tardis: A Vi- Computer Society, pp. 145–152. 7
sual Exploration Environment for Landscape Dynamics. In Pro-
ceedings of Conference on Visual Data Exploration and Analysis [geo] GeoTime. http://www.geotime.com. [Online; ac-
(1999), no. 3643, pp. 110–119. 2, 9, 10, 12 cessed 24-Jan-2014]. 12
[CFC∗ 96] C ARPENDALE S. T., FALL A., C OWPERTHWAITE [GHW09] G ROH G., H ANSTEIN H., W OERNDL W.: Interac-
D. J., FALL J., F RACCHIA F. D.: Case study: visual access for tively Visualizing Dynamic Social Networks with DySoN. In
landscape event based temporal data. In Proceedings of Visual- Workshop on Visual Interfaces to the Social and the Semantic
ization (1996), VIS ’06, IEEE Computer Society, pp. 425–428. Web (February 2009). 7
12 [GMH∗ 06] G RIFFEN A. L., M AC E ACHREN A. M., H ARDISTY
F., S TEINER E., L I B.: A Comparison of Animated Maps with
[Chi00] C HI E. H.- H .: A Taxonomy of Visualization Techniques
Static Small-Multiple Maps for Visually Identifying Space-Time
using the Data State Reference Model. In Proceedings of IEEE
Clusters. Annals of the Association of American Geographers 96,
Symposium on Information Visualization (2000), Infovis ’00,
4 (2006), 740–753. 15
IEEE, pp. 69–75. 13
[Gre11] G RETCHEN P.: A Cartographer’s Toolkit - Small Mul-
[CI05] C ASSINELLI A., I SHIKAWA M.: Khronos Projector. In
tiples. http://www.gretchenpeterson.com/blog/
Proceedings of SIGGRAPH 2005 (2005). 2, 13
small-multiples, 2011. [Online; accessed 24-Jan-2014].
[CKN∗ 03] C OLLBERG C., KOBOUROV S., NAGRA J., P ITTS J., 5
[Har99] H ARRIS R. L.: Information Graphics: A Comprehensive [McC94] M C C LOUD S.: Understanding Comics. HarperCollins,
Illustrated Reference. Oxford University Press, New York, 1999. 1994. 5
1 [MTB03] M C G UFFIN M. J., TANCAU L., BALAKRISHNAN R.:
[HEF∗ 13] H URTER C., E RSOY O., FABRIKANT S., K LEIN T., Using Deformations for Browsing Volumetric Data. In Proceed-
T ELEA A.: Bundled Visualization of Dynamic Graph and Trail ings of IEEE Visualization (October 2003), VSI ’03, pp. 401–
Data. IEEE Transactions on Visualization and Computer Graph- 408. 13
ics, 99 (2013). 10, 11 [Mun08] M UNZNER T.: Process and Pitfalls in Writing Informa-
[HET12] H URTER C., E RSOY O., T ELEA A.: Graph Bundling by tion Visualization Research Papers. In Information Visualization.
Kernel Density Estimation. Computer Graphics Forum 31 (June Springer-Verlag, 2008, p. 134–153. 3
2012), 865–874. 11 [Muy87] M UYBRIDGE E.: Animal Locomotion. Published under
[HSCW13] H ADLAK S., S CHUMANN H., C AP C. H., W OLLEN - the auspices of the University of Pennsylvania, 1887. 5
BERG T.: Supporting the Visual Analysis of Dynamic Networks [PJH05] P ETROVIC N., J OJIC N., H UANG T. S.: Adaptive Video
by Clustering associated Temporal Attributes. IEEE Transactions Fast Forward. Multimedia Tools and Applications 26, 3 (2005),
on Visualization and Computer Graphics 19, 12 (2013), 2267– 327–344. 10
2276. 6
[r] R. http://www.r-project.org/. [online,
[HTC09] H URTER C., T ISSOIRES B., C ONVERSY S.: From- accessed:02-apr-2014]. 13
DaDy: Spreading Aircraft Trajectories Across Views to Support [RFF∗ 08] ROBERTSON G., F ERNANDEZ R., F ISHER D., L EE
Iterative Queries. IEEE Transactions on Visualization and Com- B., S TASKO J.: Effectiveness of Animation in Trend Visualiza-
puter Graphics 15, 6 (2009), 1017–1024. 14 tion. IEEE Transactions on Visualization and Computer Graph-
[HV08] H OLMAN D., V ERTEGAAL R.: Organic user interfaces: ics 14, 6 (Nov. 2008), 1325–1332. 9, 10, 11, 15
designing computers in any way, shape, or form. Communica- [RM13] RUFIANGE S., M C G UFFIN M. J.: DiffAni: Visualizing
tions of the ACM 51, 6 (2008), 48–55. 14 Dynamic Graphs with a Hybrid of Difference Maps and Anima-
[Hä70] H ÄGERSTRAND T.: What about People in Regional Sci- tion. IEEE Transactions on Visualization and Computer Graph-
ence. In Papers of the Regional Science Association (1970). 2 ics 19, 12 (2013), 2556–2565. 5, 10, 11
[JD13] JANSEN Y., D RAGICEVIC P.: An interaction Model for [Ros06] ROSLING H.: Stats that reshape your world-
Visualizations Beyond The Desktop. IEEE Transactions on Vi- view. http://www.ted.com/talks/hans_rosling_
sualization and Computer Graphics (2013). In press. 7, 13, 14 the_good_news_of_the_decade.html, 2006. [online,
accessed:24-jan-2014]. 3, 10, 11
[JDF13] JANSEN Y., D RAGICEVIC P., F EKETE J.-D.: Evaluating
the Efficiency of Physical Visualizations. In Proceedings of the [RPPH12] R ASMUSSEN M. K., P EDERSEN E. W., P ETERSEN
SIGCHI Conference on Human Factors in Computing Systems M. G., H ORNBÆK K.: Shape-changing interfaces: a review of
(2013), CHI ’13, ACM, pp. 2593–2602. 14 the design space and open research questions. In Proceedings
of the SIGCHI Conference on Human Factors in Computing Sys-
[KDA∗ 09] K RISTENSSON P., DAHLBACK N., A NUNDI D., tems (2012), ACM, pp. 735–744. 14
B JORNSTAD M., G ILLBERG H., H ARALDSSON J., M ARTENS -
SON I., N ORDVALL M., S TAHL J.: An Evaluation of Space Time
[SA06] S HNEIDERMAN B., A RIS A.: Network Visualization by
Cube Representation of Spatiotemporal Patterns. IEEE Transac- Semantic Substrates. IEEE Transactions on Visualization and
tions on Visualization and Computer Graphics 15, 4 (July 2009), Computer Graphics 12, 5 (2006), 733–740. 6
696–702. 15 [SAH00] S CHROEDER W. J., AVILA L. S., H OFFMAN W.: Vi-
sualizing with VTK: a tutorial. Computer Graphics and Applica-
[KK12] K VELADZE I., K RAAK M.-J.: What do we know about
tions, IEEE 20, 5 (2000), 20–27. 13
the space-time cube from cartographic and usability perspective?
In Proceedings of the 2012 AutoCarto International Symposium [SRdJ05] S HANBHAG P., R HEINGANS P., DES JARDINS M.:
on Automated Cartography (2012), AuroCarto’12. 15 Temporal Visualization of Planning Polygons for Efficient Par-
titioning of Geo-Spatial Data. In Proceedings of the 2005
[Kra03] K RAAK M. J.: The Space-Time Cube revisited from a IEEE Symposium on Information Visualization (Washington, DC,
Geovisualization Perspective. Proceedings of the 21st Interna- USA, 2005), INFOVIS ’05, IEEE Computer Society, pp. 28–. 1,
tional Cartographic Conference (2003), 1988–1996. 2, 7 2, 6
[KW04] K APLER T., W RIGHT W.: GeoTime Information Vi- [STB] S TUSAK S., TABARD A., B UTZ A.: Can physical visu-
sualization. In Proceedings of IEEE Information Visualization alizations support analytical tasks? In Poster Abstracts of IEEE
(Washington, DC, USA, 2004), INFOVIS ’04, IEEE Computer VIS 2013. 15
Society, pp. 25–32. 9, 12
[TBC13] T HUDT A., BAUR D., C ARPENDALE S.: Visits: A
[LNS11] L IU Z., NAVATHE S., S TASKO J.: Network-based vi- Spatiotemporal Visualization of Location Histories. [online,
sual analysis of tabular data. In Proceedings of Conference accessed:24-jan-2014]. 5, 11
on Visual Analytics Science and Technology (2011), VAST ’11,
pp. 41–50. 5 [TGF08] TANG A., G REENBERG S., F ELS S.: Exploring Video
Streams using Slit-Tear Visualizations. In Proceedings of the
[Mar78] M AREY É.-J.: La méthode graphique dans les sci- working conference on Advanced visual interfaces (New York,
ences expérimentales et particulièrement en physiologie et en NY, USA, 2008), AVI ’08, ACM, pp. 191–198. 5, 6
médecine. G. Masson, 1878. 4, 5
[TMB02] T VERSKY B., M ORRISON J., B ETRANCOURT M.:
[mat] MatLab. http://www.mathworks.fr/products/ Animation: Can it facilitate? International Journal of Human-
matlab/. [online, accessed:02-apr-2014]. 13 Computer Studies 57, 4 (2002), 247–262. 15
[MB98] M ACKAY W., B EAUDOUIN -L AFON M.: DIVA: Ex- [TSAA12] T OMINSKI C., S CHUMANN H., A NDRIENKO G.,
ploratory Data Analysis with Multimedia Streams. In Proceed- A NDRIENKO N.: Stacking-Based Visualization of Trajectory At-
ings of SIGCHI Conference on Human Factors in Computing tribute Data. Visualization and Computer Graphics, IEEE Trans-
Systems (apr 1998), CHI ’98, ACM, pp. 416–423. 13 actions on 18, 12 (Dec 2012), 2565–2574. 9
[Tuf] T UFTE E.: Megan Jaegerman’s brilliant news graph- His research interests lie in the areas of information visual-
ics. http://www.edwardtufte.com/bboard/ ization and human-computer interaction, with a focus on vi-
q-and-a-fetch-msg?msg_id=0002w4. [online,
sualization of multivariate data in space and time, the design
accessed:12-apr-2014]. 4
of scalable visual interfaces and the development of pixel-
[Tuf86] T UFTE E. R.: The visual display of quantitative informa-
based algorithms such as bundling rendering techniques.
tion. Graphics Press, Cheshire, CT, USA, 1986. 1, 3, 4, 5
[TV07] T RUONG B. T., V ENKATESH S.: Video Abstraction: Sheelagh Carpendale is a professor at University of Cal-
A systematic Review and Classification. ACM Transactions gary, where she also holds a Canada Research Chair in In-
on Multimedia Computing, Communications, and Applications formation Visualization. She leads the Innovations in Visual-
(TOMCCAP) 3, 1 (2007), 3. 5
ization (InnoVis) Research Group. Her research on informa-
[VFC10] V ROTSOU K., F ORSELL C., C OOPER M.: 2D and 3D tion visualization, large interactive displays, and new media
representations for feature recognition in time geographical diary
data. Information Visualization 9, 4 (Dec. 2010), 263–276. 12 draws on her interdisciplinary background in art, design and
computer science. She has contributed a number of novel
[Vox] Voxler. http://www.goldensoftware.com/
products/voxler. [online, accessed:02-apr-2014]. 13 techniques for temporal data visualization.
[VWD04] V IÉGAS F. B., WATTENBERG M., DAVE K.: Study-
ing cooperation and conflict between authors with history flow
visualizations. In Proceedings of the SIGCHI Conference on Hu-
man Factors in Computing Systems (New York, NY, USA, 2004),
CHI ’04, ACM, pp. 575–582. 6, 10
[vWvS99] VAN W IJK J. J., VAN S ELOW E. R.: Cluster and Cal-
endar Based Visualization of Time Series Data. In Proceedings of
the IEEE Symposium on Information Visualization (Washington,
DC, USA, 1999), INFOVIS ’99, IEEE Computer Society, pp. 4–.
15
[Wik13] W IKIMEDIA: "stroke order project". http://www.
tinyurl.com/strokeOrderProject, 2013. [Online; ac-
cessed 24-Jan-2014]. 4, 5
[WvdWvW09] W ILLEMS N., VAN DE W ETERING H., VAN
W IJK J. J.: Visualization of Vessel Movements. In Proceedings
of the 11th Eurographics / IEEE- VGTC Conference on Visualiza-
tion (Aire-la-Ville, Switzerland, 2009), EuroVis’09, Eurograph-
ics Association, pp. 959–966. 15
Biography
Benjamin Bach is a PhD student in the Aviz group at IN-
RIA, France, since 2011. He received his Masters Degree
in 2010 from the Department of Computer Science at the
University of Technology, Dresden, Germany. His research
focuses on network visualization, visualization of temporal
data, interaction for information visualization.
Pierre Dragicevic is a permanent researcher in the Aviz
group at INRIA, France, since 2007. He is doing research on
human-computer interaction and information visualization,
with a focus on animation, direct manipulation, physical vi-
sualization, visual perception and decision making.
Daniel Archambault is a lecturer at Swansea University
(since 2013). His research interests include information vi-
sualization, graph drawing, and perceptual issues in visu-
alization. Daniel has worked in the area of dynamic graph
drawing and has conducted human-centered experiments in-
volving presentation methods for dynamic graphs such as
animation and small multiples as well as drawing stability
(or the “mental map”).
Christophe Hurter is an associate professor at the Inter-
active computing laboratory (LII) at the French Civil Avi-
ation University (ENAC) in Toulouse, France, since 2011.