


default search action
INFOVIS 2002: Boston, MA, USA
- Pak Chung Wong, Keith Andrews:
2002 IEEE Symposium on Information Visualization (InfoVis 2002), 27 October - 1 November 2002, Boston, MA, USA. IEEE Computer Society 2002, ISBN 0-7695-1751-X
Keynote
- William S. Cleveland:
Internet Traffic: Visualization, Discovery, and Very Large Displays. 3-4
Papers 1: Databases, Frameworks, and Visualization
- Chris Stolte, Diane Tang, Pat Hanrahan:
Multiscale Visualization Using Data Cubes "InfoVis 2002 Best Paper". 7-14 - Chris North, Nathan Conklin, Varun Saini:
Visualization Schemas for Flexible Information Visualization. 15-22 - Michelle X. Zhou, Min Chen, Ying Feng:
Building a Visual Database for Example-based Graphics Generation. 23-30
Technical Notes 1: Cartograms and Uncertainty
- Daniel A. Keim, Stephen C. North, Christian Panse
, Jörn Schneidewind:
Efficient Cartogram Generation: A Comparison. 33-36 - Chris Olston, Jock D. Mackinlay:
Visualizing Data with Bounded Uncertainty. 37-40
Papers 2: Empirical Studies
- Lucy T. Nowell, Robert S. Schulman, Deborah Hix:
Graphical Encoding for Information Visualization: An Empirical Study. 43-50 - Mats Lind, Geoffrey P. Bingham, Camilla Forsell:
The Illusion of Perceived Metric 3D Structure. 51-56 - Catherine Plaisant, Jesse Grosjean, Benjamin B. Bederson
:
SpaceTree: Supporting Exploration in Large Node Link Tree, Design Evolution and Empirical Evaluation. 57-64
Case Studies 1: Process and Bio Vis
- Kresimir Matkovic
, Helwig Hauser, Reinhard Sainitzer, M. Eduard Gröller:
Process Visualization with Levels of Detail. 67-70 - Nina Amenta, Jeff Klingner:
Case Study: Visualizing Sets of Evolutionary Trees. 71-74
Papers 3: Visualizing Hierarchies
- Jing Yang, Matthew O. Ward, Elke A. Rundensteiner:
InterRing: An Interactive Tool for Visually Navigating and Manipulating Hierarchical Structures. 77-84 - Quang Vinh Nguyen
, Mao Lin Huang
:
A Space-Optimized Tree Visualization. 85-92 - Frank van Ham, Jarke J. van Wijk:
Beamtrees: Compact Visualization of Large Hierarchies. 93-100
Papers 4: Sequences, Patterns, and Huge Data Sets
- Praveen R. Thiagarajan, Guang R. Gao:
Visualizing Biosequence Data Using Texture Mapping. 103-109 - Martin Wattenberg:
Arc Diagrams: Visualizing Structure in Strings. 110-116 - Jean-Daniel Fekete
, Catherine Plaisant:
Interactive Information Visualization of a Million Items. 117-124
Technical Notes 2: Brushing and Drill-Down
- Helwig Hauser, Florian Ledermann, Helmut Doleisch:
Angular Brushing of Extended Parallel Coordinates. 127-130 - Nathan Conklin, Sandeep Prabhakar, Chris North:
Multiple Foci Drill-Down through Tuple and Attribute Aggregation Polyarchies in Tabular Data. 131-134
Papers 5: Graph Drawing and Force-Directed Placement
- Yehuda Koren, Liran Carmel, David Harel:
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs. 137-144 - Ulrik Brandes, Steven R. Corman:
Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse. 145-151 - Alistair Morrison
, Greg Ross, Matthew Chalmers:
A Hybrid Layout Algorithm for Sub-Quadratic Multidimensional Scaling. 152-158
Case Studies 2: Finance and Web Vis
- Mei C. Chuah:
Demystifying Venture Capital Investing. 161-164 - Alan Keahey, Stephen G. Eick:
Visual Path Analysis. 165-168
Capstone
- Stephen M. Kosslyn:
Display Design for the Eye and Mind. 171

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.