# article_references

reference:
Gaba, DM, Maxwell, M, DeAnda A "Anesthetic mishaps breaking the chain of accident evolution". Anesthesiology 66 670-6. 1987


reference:
Reason, J. "Human Error". Cambridge Cambridge University Press. 1990


reference:
Goodstein, LP. "Discriminative display support for process operators, Human detection and diagnosis of system failure". Ed by Rasmussen, J Rouse WB. New York Plenum, 433-49. 1981


reference:
Vicente, KJ, Cristoffersen, K, Pereklita A "Supporting operator problem solving through ecological interface design". IEEE Transaction on Systems, Mass and Cybernetics; 25 5529-45. 1995


reference:
Boff KR, Lincoln JE "Engineering Data Compendium Human Perception and Performance". Wright-Patterson AFB, Harry G. Armstrong Medical Research Laboratory, 1988


reference:
Bennett K. B, Flach, John M. "Graphical Displays Implications for Divided Attention, Focused Attention, and Problem Solving" Human Factors, 34 513-533 1992


reference:
Wildbur, P, Burke M "Information Graphics; Innovative Solutions in Contemporary Design", Thames and Hudson, London, 1998


reference:
MacEachren, A.M., F. Boscoe, D. Haug, and L. Pickle. "Geographic Visualization Designing Manipulable Maps for Exploring Temporally Varying Georeferenced Statistics". Proceedings of Information Visualization '98. IEEE Computer Society, Raleigh-Durham, NC, Oct. 19-20, 1998, pp. 87-94.


reference:
Edsall, R. "Development of Interactive Tools for the Exploration of Large Geographic Databases". 19th International Cartographic Conference, Ottawa, University of Victoria. 34B. 1999.


reference:
Dykes, J.A. "Cartographic Visualization Exploratory Spatial Data Analysis with Local Indicators of Spatial Association using Tcl/Tk and cdv", The Statistician, 47(3), 485-497. 1998.


reference:
Wegman, J. J. "Hyperdimensional Data Analysis Using Parallel Coordinates". Journal of the American Statistical Association 85(411) 664-675. 1990.


reference:
Inselberg, A. "The Plane with Parallel Coordinates". The Visual Computer 1 69-97. 1985.


reference:
A. Papakostas and I. G. Tollis, "Interactive Orthogonal Graph Drawing", IEEE Trans. Computers, 47(11), pp. 1297, 1998.


reference:
D. Harel and Y. Koren, "A Fast Multi-Scale Method for Drawing Large Graphs", Research Report MCS99-21, Weizmann Institute of Science, November 1999.


reference:
G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, "Graph Drawing Algorithms for the Visualization of Graphs", Prentice-Hall, 1999.


reference:
J. M. Six and I. G. Tollis, "Circular Drawings of Biconnected Graphs", Proc. of ALENEX '99, LNCS 1619, Springer-Verlag, pp. 57-73, 1999.


reference:
U. Dogrusoz, B. Madden and P. Madden, "Circular Layout in the Graph Layout Toolkit", Proc. GD '96 LNCS 1190, Springer-Verlag, pp. 92-100, 1997.


reference:
R. Sablowski and A. Frick, "Automatic Graph Clustering", Proc. GD '96, LNCS 1190, Springer-Verlag, 1997.


reference:
P. Eades, Q. Feng and X. Lin, "Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs", Proc. GD '96, LNCS 1190, Springer-Verlag, pp. 113-128, 1997.


reference:
P. Eades, Q. W. Feng and H. Nagamochi,"Drawing Clustered Graphs on an Orthogonal Grid", Jrnl. of Graph Algorithms and Applications, pp. 3-29, 1999.


reference:
F. Brandenburg, "Graph Clustering 1 Cycles of Cliques", Proc. GD '97, LNCS 1353, Springer-Verlag pp. 158-168, 1997.


reference:
C. A. Duncan, M. T. Goodrich and S. G. Kobourov, "Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs", Proc. GD '98, LNCS 1547, Springer-Verlag, 1998.


reference:
M. L. Huang and P. Eades, "A Fully Animated Interactive System for Clustering and Navigating Huge Graphs", Proc. of GD '98, LNCS 1547, Springer-Verlag, pp. 107-116, 1998.


reference:
J. M. Six and I. G. Tollis, "A Framework for Circular Drawings of Networks", Proc. of GD '99, LNCS 1731, Springer-Verlag, pp. 107-116, 1999.


reference:
F. J. Newbery, "Edge Concentration, A Method for Clustering Directed Graphs", Proc. 2nd Intl. Workshop on Software Configuration Management, pp.76-85, 1989.


reference:
P. Eades and Q. W. Feng, "Multilevel Visualization of Clustered Graphs", Proc. GD '96, LNCS 1190, Springer-Verlag, pp. 101-112, 1997.


reference:
C. A. Duncan, M. T. Goodrich and S. G. Kobourov, "Planarity-Preserving Clustering and Embedding for Large Planar Graphs", Proc. GD '99, LNCS 1731, Springer-Verlag, pp.186-196, 1999.


reference:
G. Di Battista, P. Eades, R. Tamassia and I. Tollis, "Algorithms for Drawing Graphs An Annotated Bibliography", Computational Geometry Theory and Applications, 4(5), pp. 235-282, 1994.


reference:
F. Brandenburg and A. Sen, "Graph Clustering II Trees of Cliques with Size Bounds", Proc. of GD '99, LNCS 1731, Springer-Verlag, pp. 158-168, 1999.


reference:
Corneil, "The Complexity of Generalized Clique-Packing", Discrete Applied Mathematics, 12(85), pp. 233-239, 1985.


reference:
G. Di Battista, R. Tamassia and I. G. Tollis, "Constrained Visibility Representations of Graphs", Theoretical Computer Science, 61, pp. 175-198, 1988.


reference:
P. Gajer, M. T. Goodrich and S. G. Kobourov, "A Fast Multi-Dimensional Algorithm for Drawing Large Graphs", Proc. GD 2000, LNCS 1984, pp. 211-221, 2001.


reference:
G. Kar, B. Madden and R. Gilbert, "Heuristic Layout Algorithms for Network Presentation Services", IEEE Network, 11,pp. 29-36, 1988.


reference:
V. Krebs, "Visualizing Human Networks", Release 1.0 Esther Dyson's Monthly Report, pp. 1-25, February 12, 1996.


reference:
D. Ostry, "Some Three-Dimensional Graph Drawing Algorithms", Master's Thesis, University of Newcastle, October 1996.


reference:
A. Papakostas, "Information Visualization Orthogonal Drawings of Graphs", Ph.D. Thesis, University of Texas at Dallas, 1996.


reference:
J. M. Six, "Vistool A Tool For Visualizing Graphs", Ph.D. Thesis, The University of Texas at Dallas, 2000.


reference:
J. M. Six and I. G. Tollis, "Circular Drawings of Telecommunication Networks", Proc. 7th Hellenic Conference on Informatics, pp. II.124-131, 1999.


reference:
K. Sugiyama and K. Misue, "Visualization of Structural Information Automatic Drawing of Compound Digraphs", IEEE Trans. Soft. Eng., 21(4), pp. 876-892, 1991.


reference:
P. Eades, "A Heuristic for Graph Drawing", Congr. Numer., 42, pp. 149-160, 1984.


reference:
T. Lengauer, "Combinatorial Algorithms for Integrated Circuit Layout", John Wiley and Sons, 1990.


reference:
F. N. Paulisch, "EDGE An Extendible Graph Editor", Soft. Prac. and Exp., 20(S1), pp. S163-88, 1990.


reference:
Mackinlay, J. D., Robertson, G. G., and Card, S. K., "The Perspective Wall Detail and context smoothly integrated", Proceedings of CHI '91, 1991.


reference:
Card, S. K., Robertson, G. G., and Mackinlay, J. D., "The Information Visualizer, an information workspace," Proceedings of CHI '91, 1991.


reference:
Robertson, G. G., Mackinlay, J. D., and Card, S. K., "Cone Trees Animated 3D visualizations of hierarchical information", Proceedings of CHI '91, 1991.


reference:
Chang, B.-W. and Ungar, D., "Animation From Cartoons to the User Interface," Proceedings of UIST '93, Atlanta, GA, 1993.


reference:
Di Battista, G., Eades, P., Tamassia, R., and Tollis, I. G., "Graph Drawing Algorithms for the Visualization of Graphs". Upper Saddle River, N. J Prentice Hall, 1999.


reference:
Herman, I., Melançon, G., and Marshall, M. S., "Graph Visualisation and Navigation in Information Visualisation", Proceedings of Eurographics '99, Aire-la-Ville, 1999.


reference:
North, S. C., "Incremental Layout in DynaDAG", Proceedings of Graph Drawing '95, 1996.


reference:
Munzner, T., "H3 Laying Out Large Directed Graphs in 3D Hyperbolic Space", Proceedings of Information Visualization '97, 1997.


reference:
Brandes, U., Kääb,, V., Löh, A., Wagner, D., and Willhalm, T., "Dynamic WWW Structures in 3D," Journal of Graph Algorithms and Applications, vol. 4, no. 3, pp. 183-191, 2000.


reference:
Clip2 DSS, "Gnutella Protocol Specification v0.4", http //www.clip2.com/GnutellaProtocol04.pdf


reference:
Clip2 DSS, "Partial Map of Gnutella Network, 7/27/00", http //www.clip2.com/dss_map.html


reference:
Dhamija, R., Fisher, D., and Yee, K.-P., "Gnutellavision Real-Time Visualization of a Peer-to-Peer Network", 2000, http //bailando.sims.berkeley.edu/infovis/gtv/


reference:
Eades, P., "Drawing Free Trees", Bulletin of the Institute of Combinatorics and its Applications, pp. 10-36, 1992.


reference:
Eades, P. and Huang, M. L., "Navigating Clustered Graphs using Force-Directed Methods", Journal of Graph Algorithms and Applications, vol. 4, no. 3, pp. 157-181, 2000.


reference:
Freeman, L., "Visualizing Social Networks", Journal of Social Structure, Carnegie Mellon University, vol. 1, no. 1, 2000.


reference:
Van Rossum, G., "Python programming language", http //www.python.org/


reference:
Steinberg, S. G., "Map of the Gnutella network", http //www.geog.ucl.ac.uk/casa/martin/atlas/more_topology.html


reference:
Wasserman, S. and Faust, K., "Social network analysis methods and applications", Cambridge University Press, 1994.


reference:
Wills, G. J., "NicheWorks-interactive visualization of very large graphs", Proceedings of Graph Drawing '97, 1997.


reference:
Lamping, J. and Rao, R., "The Hyperbolic Browser A Focus + Context Technique for Visualizing Large Hierarchies", Journal of Visual Languages and Computing, vol. 7, no. 1, pp. 33-55.


reference:
M. Faloutos, P. Faloutsos, C. Faloutsos. "On power-law relationships of the internet topology". In Comp. Comm. Rev., Vol. 29, pages 251-262, 1999.


reference:
P. Eades, Q. W. Feng, X. Lin. "Straight-line drawing algorithms for hierarchical and clustered graphs". In Proc. 4th Symp. on Graph Drawing, pages 113-128, 1996.


reference:
J. Abello, J. Korn. "Visualizing Massive Multi-Digraphs". In IEEE Proc. Information Visualization, pages 39-47, Salt Lake City, 2000.


reference:
K. Sugiyama, K. Misue. "Visualization of structural information Automatic drawing of compound digraphs". In IEEE Transactions on Systems, Man and Cybernetics, Vol. 21, No 4, pages 876-892, 1991.


reference:
A. Broder. "Graph Structure in the Web". In Networks, Vol. 33, pages 309-320, 2000.


reference:
L. Cowen. "A linear time algorithm for network decomposition". Dimacs TR series, No 94-56, December 1994.


reference:
P. Gajer, M. Goodrich, S. Kobourov. "A multidimensional approach to force directed layouts of large graphs". In Proc. of Graph Drawing, Lecture Notes of Computer Science, Springer Verlag, 2000.


reference:
D. Karabeg. "Parallel Algorithm Graph Reduction". TR No. CS88-120, University of California, San Diego, March 1988.


reference:
V. Kumar, E. J. Schwabe. "Improved algorithms and data structures for solving graph problems in external memory". Proc. 8th IEEE SPDP, pages 169-176, 1996.


reference:
B. Shneiderman. "Information Visualization Dynamic queries, starfield displays, and LifeLines". In www.cs.umd.edu, 1997.


reference:
J. Abello, S. Krishnan. "Navigating Graph Surfaces". In Approximation and Complexity in Numerical Optimization Continuous and Discrete Problems, P. Pardalos(Ed.), pages 1-16. Kluwer Academic Publishers, 1999.


reference:
Nelson, T. H., "The Right Way to Think About Software Design". In B. Laurel (Ed.), The Art of Human-Computer Interface Design Reading, Massachusetts, USA Addison Wesley Publishing, 1990, pp.235-243.


reference:
Scaife, M. and Rogers, Y., "External cognition how do graphical representations work?" International Journal of Human-Computer Studies, 1990, 45, pp. 185-213.


reference:
W. Cleveland, "Elements of Graphing Data", Kluwer Academic Publishing, New York, NY, 1994.


reference:
M. Chuah, "Dynamic Aggregation with Circular Visual Designs", in Proceedings of the 1998 IEEE Information Visualization Symposium 1998, ACM Press, Research Triangle Park, NC, 1998, 35-43.


reference:
I. Herman, M. Delest, and G. Melancon, "Tree Visualization and Navigation Clues for Information Visualization", National Research Institute for Mathematics and Computer Science INS-R9806, Amsterdam, Netherlands, 1998.


reference:
D. Turo and B. Johnson, "Improving the Visualization of Hierarchies with Treemaps Design Issues and Experimentation". University of Maryland Human-Computer Interaction Laboratory Technical Report 92-06, College Park, MD 1992.


reference:
B.K. Kleiner and J.A. Hartigan, "Representing Points in Many Dimensions by Trees and Castles", Journal of the American Statistical Association, American Statistical Association, Alexandria, VA, June 1981, 260-272.


reference:
D. Gillan, "A Componential Model of Human Interaction with Graphs V Using Pie Graphs to make Comparisons", in Proceedings of the IEA 2000/HFES 2000 Congress, HFES, San Diego, CA, 2000, 439-442.


reference:
E. Reingold and J. Tilford, "Tidier Drawings of Trees". IEEE Transactions on Software Engineering, Washington DC, 1981, 223-228.


reference:
K. Andrews and H. Heidegger. "Information Slices Visualizing and Exploring Large Hierarchies using Cascading, Semi-circular Discs", in IEEE Information Visualization Symposium 1998 Late Breaking Hot Topics ACM Press, Research Triangle Park NC, 1998, 9-12.


reference:
R. Rao and S. K. Card, "The Table Lens Merging Graphical and Symbolic Representations in an Interactive Focus + Context Visualization for Tabular Information", Proceedings of CHI'94, New York, 1994, pp. 318-322.


reference:
M. Spenke, C. Beilken, and T. Berlage, "The Interactive Table for Product Comparison and Selection", UIST 96 Ninth Annual Symposium on User Interface Software and Technology, Seattle, 1996, pp. 41-50. http //fit.gmd.de/~cici/Focus/Paper/uist96.htm


reference:
E. Callahan and J. Koenemann, "A Comparative Usability Evaluation of User Interfaces for Online Product Catalogs", 2nd ACM Conference on Electronic Commerce, Minneapolis, MN, 2000, pp. 197-206.


reference:
J. T. Stasko, R. Catrambone, M. Guzdial, and K. McDonald, "An Evaluation of Space-Filling Information Visualizations for Depicting Hierarchical Structures," International Journal of Human-Computer Studies, vol. 53, pp. 663-694, 2000.


reference:
U. Wiss and D. A. Carr, "An Empirical Study of Task Support in 3D Information Visualizations", 1999 International Conference on Information Visualization, London, England, 1999, pp. 392-399.


reference:
C. Ahlberg and E. Wistrand, "IVEE An Information Visualization and Exploration Environment", InfoVis'95, New York, NY, 1995, pp. 66-73.


reference:
T. M. Mann and H. Reiterer, "Evaluation of Different Visualization of WWW Search Results", 11th IEEE International Workshop on Database and Expert Systems Applications, Greenwich, England, 2000, pp.586-590.


reference:
E. Morse, M. Lewis, and K. A. Olsen, "Evaluating Visualizations Using a Taxonomic Guide", International Journal of Human-Computer Studies, vol.53, pp. 637-662, 2000.


reference:
K. Risden, M. P. Czerwinski, T. Munzner, and D. B. Cock, "An Initial Examination of Ease of Use for 2D and 3D Information Visualizations of Web Content", International Journal of Human-Computer Studies, vol. 53, pp. 695-714, 2000.


reference:
M. Spenke and C. Beilken, "Discovery Challenge Visual, Interactive Data Mining with InfoZoom - the Financial Data Set", Workshop Notes on Discovery Challenge, 3rd European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD '99, 1999, pp. 33-38. http //fit.gmd.de/~cici/InfoZoom/DiscoveryChallenge/Financial.ps


reference:
J. G. Trafton, S. S. Kirschenbaum, T. L. Tsui, R. T. Miyamoto, J. A. Ballas, and P. D. Raymond, "Turning Pictures into Numbers Extracting and Generating Information from Complex Visualizations", International Journal of Human-Computer Studies, vol. 53, pp. 827-850, 2000.


reference:
E. Wistrand, "Visualization Methods for Dynamic Queries Databases". Master Thesis, Dept. of Computing Science, Göteborg University and Chalmers University of Technology, 1994.


reference:
G. W. Furnas, "The FISHEYE View a New Look at Structured Files", Bell Laboratories, Technical Memorandum 81-11221-9, October 12, 1981.


reference:
E. Chi, P. Pirolli, J. Pitkow, "The Scent of a Site A System for Analyzing and Predicting Information Scent, Usage and Usability of a Web Site". In Proceedings of the Human Factors in Computing Systems, CHI 2000, pp 161-168, April 2000.


reference:
J. Hong, J.Landay, "WebQuilt A Framework for Capturing and Visualizing the Web Experience". In Proc. of the 10th International WWW Conference, Hong Kong, May 1-5, 2001.


reference:
K. Avedal and others, "Professional JSP". WROX, 2000.


reference:
E. Frecon, G. Smith, "WebPath - A Three Dimensional Web History". In Proc. IEEE Information Visualization '98, pp 3-10, October 1998.


reference:
J.L. Korn, A.W. Appel, "Traversal-based Visualization of Data Structures". In Proc. IEEE Information Visualization '98, pp 11-18, October 1998.


reference:
T. Munzner, E. Hoffman, K. Claffy, B. Fenner, "Visualizing the Global Topology of the MBone". In Proc. IEEE Information Visualization '96, pp 85-92, October 1996.


reference:
T. Munzner, "H3 Laying Out Large Directed Graphs in 3D Hyperbolic Space". In Proc. IEEE Information Visualization '97, pp 2-10, October 1997.


reference:
T.J. Overbye, J.D. Weber, "NewMethods for the Visualization of Electric Power System Information". In Proc. IEEE Information Visualization 2000, pp 131-136, October 2000.


reference:
I. Herman, M.S. Marshall, G. Melancon, "Density Functions for Visual Attributes and Effective Partitioning in Graph Visualization". In Proc. IEEE Information Visualization 2000, pp 49-56, October 2000.


reference:
J. Abello, J. Korn, "Visualizing Massive Multi-Digraphs". In Proc. IEEE Information Visualization 2000, pp 39-47, October 2000.


reference:
K. Andrews, M. Pichler, P. Wolf, "Towards Rich Landscapes for Visualizing Structured Web Spaces". In Proc. IEEE Information Visualization '96, pp 62-63, October 1996.


reference:
M. Deshpande, G. Karypis, "Selective Markov Models for Predicting Web-Page Accesses", University of Minnesota Technical Report 00-056, October 2000.


reference:
A. Papoulis, "Probability, Random Variables, and Stochastic Processes". McGraw Hill, 1991.


reference:
P. Underhill, "Why We Buy The Science of Shopping". Simon & Schuster, 1999.


reference:
"A competition within KDD-2000 (The Sixth ACM SIGKDD International Conference on Knowledge Discovery and DataMining)", Boston, MA, August 2000. The data is available for download from www.bluemartini.com/kddcup2000.


reference:
K.C. Cox, S.G. Eick, "3D Displays of Internet Traffic". In Proc. IEEE Information Visualization '95, pp 129-131, October 1995.


reference:
R.J. Quinlan, "Programs for Machine Learning", Morgan Kaufmann, San Mateo, CA, 1993.


reference:
P. Dykstra, "Xdu", US Army Research Laboratory, 1991. Available at http //sd.wareonearth.com/~phil/xdu/


reference:
L. Breiman, J. H. Friedman, R.A. Olshen, and C.J. Stone, "Classification and Regression Trees", Wadworth, Belmont, CA, 1984.


reference:
T. Ball and S. G. Eick. "Software visualization in the large". Computer, 29(4) 33-43, Apr. 1996.


reference:
J. S. Collofello and S. N.Woodfield. "Evaluating the effectiveness of reliability-assurance techniques". Journal of Systems and Software, 9(3) 191-195, 1989.


reference:
Telcordia Technologies, Inc. "xATAC A tool for improving testing effectiveness". http //xsuds.argreenhouse.com/htmlman/coverpage.html.


reference:
I. Vessey. "Expertise in debugging computer programs". International Journal of Man-Machine Studies A process analysis, 23(5) 459-494, 1985.


reference:
S. G. Eick, L. Steffen, Joseph, and E. E. Sumner Jr. "Seesoft-A tool for visualizing line oriented software statistics". IEEE Transactions on Software Engineering, 18(11) 957-968, Nov. 1992.


reference:
M. C. Stone, K. Fishkin, and E. A. Bier. "The movable filter as a user interface tool". In Proceedings of the ACM Conference on Computer Human Interaction, 1994.


reference:
M. Carpendale, D. Cowperthwaite, and D. Fracchia. "3D pliable surfaces For the effective presentation of visual information". In Proceedings of the ACM Symposium on User Interface Software and Technology, pages 217-226, 1995.


reference:
B. B. Bederson and J. D. Hollan. "Pad++ A zoomable graphical interface". In Proceedings of the ACM Conference on Computer Human Interaction, 1994. Short paper.


reference:
G. W. Furnas. "Generalized fisheye views". Human Factors in Computing Systems, CHI '86, pages 16-23, Apr. 1986.


reference:
G. W. Furnas and B. B. Bederson. "Space-scale diagrams Understanding multiscale interfaces". In Proceedings of the ACM Conference on Computer Human Interaction, 1995.


reference:
S. Jul and G. W. Furnas. "Critical zones in desert fog Aids to multiscale navigation". In Proceedings of the ACM Symposium on User Interface Software and Technology, 1998.


reference:
T. A. Keahey. "The generalized detail-in-context problem". In Proceedings of the IEEE Symposium on Information Visualization, IEEE Visualization, Oct. 1998.


reference:
T. Munzner. "H3 Laying out large directed graphs in 3D hyperbolic space". In Proceedings of the IEEE Symposium on Information Visualization, IEEE Visualization, Oct. 1997.


reference:
M.-A. D. Storey, K. Wong, F. Fracchia, and H. Muller. "On integrating visualization techniques for effective software exploration". In Proceedings of the IEEE Symposium on Information Visualization, IEEE Visualization, 1997.


reference:
T. A. Keahey and E. L. Robertson. "Nonlinear magnification fields". In Proceedings of the IEEE Symposium on Information Visualization, IEEE Visualization, Oct. 1997.


reference:
B. Johnson and B. Shneiderman. "Treemaps A space-filling approach to the visualization of hierarchical information structures". In Proceedings of IEEE Visualization, 1991.


reference:
D. Turo and B. Johnson. "Improving the visualization of hierarchies with treemaps Design issues and experimentation". In Proceedings of IEEE Visualization, 1992.


reference:
J. Dill, L. Bartram, A. Ho, and F. Henigman. "A continuously variable zoom for navigating large hierarchical networks". In Conference on Systems, Man and Cybernetics, pages 386-390, 1994.


reference:
T. A. Keahey. "Nonlinear Magnification". PhD thesis, Department of Computer Science, Indiana University, Dec. 1997.


reference:
J.D. Mackinlay, G.G. Robertson and R. DeLine. "Developing Calendar Visualizers for the Information Visualizer". Proc. UIST '94, 1994


reference:
Edward R. Tufte. "The Visual Display of Quantitative Information". Graphics Press, Cheshire, Connecticut, 1983


reference:
William S. Cleveland. "The Elements of Graphing Data". Wadsworth Advanced Book Program, Pacific Grove, 1985


reference:
Robert L. Harris. "Information Graphics - A Comprehensive Illustrated Reference". Management Graphics, Atlanta, Georgia, 1996


reference:
D.A. Keim and H.P. Kriegel. "VisDB Database Exploration Using Multidimensional Visualization". IEEE CG&A, Sept. 1994, pp. 40-49


reference:
Susan Havre, Beth Hetzler, and Lucy Nowell. "Theme-River Visualizing Theme Changes over Time". Proceedings of IEEE Symposium on Information Visualization, InfoVis 2000, 2000, pp. 115 - 123.


reference:
A. Buja, J. A. McDonald, J. Michalak, W. Stützle. "Interactive Data Visualization Using Focusing & Linking". Proceedings Visualization '91, IEEE Computer Society Press, Los Alamitos, 1991, pp. 156-163


reference:
K. Priyantha Hewagamage and Masahito Hirakawa. "Pattern Browser Spiral-Based Interactive Visualization Using Timelines on a Geographical Map". IEICE Trans. Inf. & Syst., Vol. E83-D, No. 8, pp. 1679-1686


reference:
William Playfair. "The Commercial and Political Atlas". London, 1786


reference:
William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. "Numerical Recipes". Cambridge University Press, Cambridge, 1991


reference:
Heidrun Schumann and Wolfgang Müller. "Visualisierung - Grundlagen und allgemeine Methoden". Springer Verlag, Heidelberg, 2000


reference:
J. Bertin. "Semiology of Graphics". The University of Wisconsin Press, 1983


reference:
Antonio Gabglio. "Theoria generale della statistica". Milan, 2nd Edition, 1888


reference:
Susan Havre, Beth Hetzler, and Lucy Nowell. "Theme-RiverTM In Search of Trends, Patterns, and Relationships". IEEE Symposium on Information Visualization, InfoVis '99, October 25-26, San Francisco CA.


reference:
Kohonen, T. "Self-organized formation of topologically correct feature maps". Biological Cybernetics, 1982, 43 59-69.


reference:
Davidson, R. and Harel, D., "Drawing graphs nicely using simulated annealing", Technical Report CS89-13, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot, Israel., 1989.


reference:
Davidson, G.S., Hendrickson, B., Johnson, D.K., Meyers, C.E. & Wylie, B.N. "Knowledge mining with VxInsight discovery through interaction". Journal of Intelligent Information Systems 11, 1998, 259-285.


reference:
Wise, J.A. "The ecological approach to text visualization". Journal of the American Society for Information Science 50(13), (1999), 1224-1233.


reference:
Wise, J.A., Thomas, J.J., Pennock, K., Lantrip, D., Pottier, M., Schur, A., & Crow, V. "Visualizing the Non-Visual Spatial Analysis and Interaction with Information from Text Documents", Proceedings of InfoVis '95, IEEE, 1995, 51-58.


reference:
Spellman, P.T., Sherlock, G., Zhang, M.Q., Iyer, V.R., Anders, K., Eisen, M.B., Brown, P.O., Botstein, D. and Futcher, B., "Comprehensive identification of cell cycle-regulated genes of the yeast Saccharomyces cerevisiae by microarray hybridization", Mol. Biology of the Cell, 1998, 9 3273-3297.


reference:
MacQueen, J. "Some methods for classification and analysis of multivariate observations". Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability. Volume I Statistics,. University of California Press, Berkeley and Los Angeles, CA, 1967, pages 281-297.


reference:
Wilcox, R.R., "Introduction to Robust Estimation and Hypothesis Testing", Academic Press, 1997, ISBN 0-12-751545-3.


reference:
Ostel, B., "Statistics In Research Basic Concepts and Techniques for Research Workers", Iowa State University Press, Ames, Iowa, USA, 1963


reference:
Fisher, R.A., "On the probable error of a coefficient of correlation deduced from a small sample". Metron., 1921, 1 (No.4) 3.


reference:
Quinn, N. and Breur M., "A force directed component placement procedure for printed circuit boards", IEEE Trans on Circuits and Systems, 1979, CAS-26, (6), 377-388


reference:
Kamada, T. and Kawai, S., "Automatic display of network structures for human understanding", Technical Report 88-007, Department of Information Science, Tokyo University, 1988


reference:
Kamada, T. and Kawai, S., "A simple method for computing general position is displaying three-dimensional objects", Computer Vision, Graphics, and Image Processing, 1988, 41, 43-56.


reference:
Kirkpatrick, S. Gelatt, C.D. and Vecchi, M.P., "Optimization by simulated annealing", Science, 1983, 220, (4598), 671-680.


reference:
Eades, P., "A heuristic for graph drawing", Congressus Numerantium, 42, 1984, 149-160.


reference:
Kamada, T. and Kawai, S., "An algorithm for drawing general undirected graphs", Information Processing Letters, 1989, 31, (1), 7-15.


reference:
Fruchtermann, T. and Rheingold, E. "Graph drawing by force-directed placement". Technical Report UIUCDCS-R-90-1609, Computer Science, Univ. Illinois, Urbana-Champagne, Il., 1990.


reference:
Otten, R. and van Ginneken, L., "The Annealing Algorithm", Kluwer Academic Publishers, Boston MA., 1989.


reference:
York, J., Bohn, S., Pennock, K., & Lantrip, D. "Clustering and Dimensionality Reduction in SPIRE". Symp. on Advanced Intelligence Processing and Analysis, (1995), 73


reference:
Olsen, K., Korfhage, R.,,Sochats, K., Spring, M., & Williams, J. (1993) "Visualizing of a Document Collection The VIBE System". In Information Processing and Management 29, 1 (1993), 69-81.


reference:
Ahlberg, C. Shneiderman, B. "Visual Information Seeking Tight Coupling of Dynamic Query Filters with Starfield Displays". Proc. CHI '94. ACM Press, 313-317.


reference:
Tufte, E. (1983) "The Visual Display of Quantitative Information", Graphics Press Cheshire, CT. p. 42.


reference:
Wise, J., Thomas, J., et al. (1995) "Visualizing the Non-Visual Spatial Analysis and Interaction with Information from Text Documents", in Proceedings of IEEE '95 Information Visualization.


reference:
Brodbeck, D., Chalmers, M., Lunzer, A., Cotture, P. (1997) "Domesticating Bead Adapting an Information Visualization System to a Financial Institution". In Proceedings of IEEE InfoVis '97, IEEE.


reference:
Leuski, A. and Allan, J. (2000) "Lighthouse Showing the Way to Relevant Information". In Roth, S.R. and Keim, D. A. (eds), Proceedings of Information Visualization 2000, October 9-11, Salt Lake City, UT, 125-129.


reference:
Bragatto, P., Mazzino, N., & Palamidese, P. (1991) "Animated Visualization of Scalar Fields". Proc. of Second Eurographics Workshop on Animation and Simulation, Vienna, 115 - 127.


reference:
Brewer, W. & Samarapungavan, A. (1991) "Children's theories vs. scientific theories Differences in Reasoning or Differences in Knowledge?" In R. R. Hoffman and D.S. Palermo (eds), Cognition and the Symbolic Processes Applied and Ecological Perspectives. Hillsdale, NJ Lawrence Erlbaum Associates, Inc., 209-232.


reference:
Brooks, R. (1991) "Intelligence Without Representation". Artificial Intelligence, 47, 139-159.


reference:
Carpenter, S. (2001) "Sights Unseen". In Monitor on Psychology, 32(4), April 2001. Available at http //www.apa.org/monitor/apr01/blindness.html


reference:
Dennett, D. (1991) "Consciousness Explained". Boston Little, Brown, and Company.


reference:
DiGirolamo, G. & Hintzman, D. (1997) "First Impressions Are Lasting Impressions A Primacy Effect in Memory for Repetitions". Psychonomic Bulletin and Review, 4(1), 121-124.


reference:
French, R. (1953) "The Discrimination of Dot Patterns as a Function of the Number and Average Separation of Dots". Journal of Experimental Psychology, 46, 1-9.


reference:
Littlefield, R. & Nicholson, W. (1982) "Use of Color and Motion for the Display of Multi-Dimensional Data", Multivariate Analysis Workshop, 1982 DOE Statistical Symposium, Idaho Falls, Idaho, October 13-14.


reference:
MacEachren, A. (1995) "How Maps Work". The Guilford Press, New York. 422-433.


reference:
Most, S.,Simons, D., Scholl, B., & Chabris, C. (2000) "Sustained Inattentional Blindness the Role of Location in the Detection of Unexpected Dynamic Events". In PSYCHE, 6(14), December, 6-14.


reference:
Noe, A., Pessoa, L., & Thompson, E. "Beyond the Grand Illusion What Change Blindness Really Teaches Us About Vision". In Visual Cognition, 7, 93-106.


reference:
Nowell, L. (1997). "Graphical Encoding for Information Visualization Using Icon Color, Shape, and Size to Encode Nominal and Quantitative Data". Doctoral dissertation for the Virginia Tech Department of Computer Science, Blacksburg, VA. Available at http //scholar.lib.vt.edu/theses/available/etd-111897-163723/


reference:
O'Regan, J. (2001) "Change Blindness. In Encyclopedia of Cognitive Science". Available at http //nivea.psycho.univ-paris5.fr/ECS/ECSCB/html


reference:
O'Regan, J., Deubel, H, Clark, J., Rensick, R.(2000) "Picture Changes During Blinks Looking Without Seeing and Seeing Without Looking". In Visual Cognition, 7, 191-212.


reference:
Pani, J. (2000) "Cognitive Description and Change Blindness". In Visual Cognition, 7, 107-126.


reference:
Rensick, R. (2000a) "The Dynamic Representation of Scenes". In Visual Cognition, 7, 17-42.


reference:
Rensick, R. (2000b) "Visual Search for Change A Probe into the Nature of Attentional Processing". In Visual Cognition, 7, 345-376.


reference:
Rensick, R., O'Regan, J., Clark, J. (2000c) "On the Failure to Detect Changes in Scenes Across Brief Interruptions". In Visual Cognition, 7, 127-145.


reference:
Shapiro, K. (2000) "Change Blindness Theory or Paradigm?" In Visual Cognition, 7, 83-91.


reference:
Simons, D. & Chabris, C. (1999) "Gorillas in Our Midst Sustained Inattentional Blindness for Dynamic Events". In Perception, 28(9), 1059-1074.


reference:
Simons, D. (2000) "Current Approaches to Change Blindness". In Visual Cognition, 7, 1-15.


reference:
Simons, D. (ed) (2000) "Visual Cognition Special Issue - Change Blindness and Visual Memory", 7 (1/2/3) January-March.


reference:
Simons, D., Chabris, C., & Levin, D. (1999) "Change Blindness Is Not Caused by Later Events Overwriting Earlier Ones in Visual Short-Term Memory". Manuscript in preparation.


reference:
Werner, S. & Theis, B. (2000) "Is 'Change Blindness' Attenuated by Domain-specific Expertise? An Expert-Novices Comparison of Change Detection in Football Images". In Visual Cognition, 7, 163-174.


reference:
Triesman, A. (1980) "Preattentive Processing in Vision". Computer Vision, Graphics, and Image Processing 31 156-177.


reference:
Wolfe, J., Friedman-Hill, S., Stewart, M., O'Connell, K. (1992) "The Role of Categorization in Visual Search for Orientation". Journal of Experimental Psychology Human Perception and Performance, 18(1), 34-49.


reference:
Hendley. R., Drew, N., Wood, A., and Beale, R. (1999) "Narcissus Visualizing Information". In Card, S. K.; Mackinlay, J.D., and Shneiderman, B. (eds), Readings in Information Visualization Using Vision to Think, San Francisco Morgan Kaufmann, 503-511.


reference:
Crow, V., Pennock, K., Pottier, M., Schur, A., Thomas, J., Wise, J., Lantrip, D., Fiegel, T., Struble, C., York, J. (1994) "Multidimensional Visualization & Browsing for Intelligence Analysis", Gviz '94 Graphics & Visualization Conference, Richland, WA.


reference:
E. A. Bier, M. C. Stone, K. Pier, W. Buxton, and T. D. DeRose. "Toolglass and magic lenses The see-through interface". Computer Graphics (Proceedings SIGGRAPH'93), 27(Annual Conference Series) 73-80, 1993.


reference:
M. Sarkar, S. S. Snibbe, O. J. Tversky, and S. P. Reiss. "Stretching the rubber sheet A metaphor for visualizing large layouts on small screens". In Proceedings of the ACM Symposium on User Interface Software and Technology, Visualizing Information, pages 81-91, 1993.


reference:
Y. K. Leung and M. D. Apperley. "A review and taxonomy of distortion-oriented presentation techniques". ACM Trans. on Computer-Human Interaction, 1(2) 126-160, June 1994.


reference:
M. C. Stone, K. Fishkin, and E. A. Bier. "The movable filter as a user interface tool". In Proceedings of ACM CHI'94 Conference on Human Factors in Computing Systems, volume 1 of Information Visualization, pages 306-312, 1994.


reference:
G. W. Furnas. "Generalized fisheye views". In M. M. Mantei and P. Orbeton, editors, Proceedings of the ACM Conference on Human Factors in Computer Systems, SIGCHI Bulletin, pages 16-23, New York, U.S.A., 1986. Association for Computer Machinery.


reference:
J. Lamping, R. Rao, and P. Pirolli. "A focus+context technique based on hyperbolic geometry for visualizing large hierarchies". In Proceedings CHI'95. ACM, 1995.


reference:
I. Lokuge and S. Ishizaki. "Geospace An interactive visualization system for exploring complex information spaces". In CHI'95 Proceedings, 1995.


reference:
J. Huang, K. Mueller, N. Shareef, and R. Crawfis. "Fastsplats Optimized splatting on rectilinear grids". In Proc. Visualization 2000, Salt Lake City, USA, Oct. 2000. IEEE.


reference:
M. Potmesil and I. Chakravarty. "A lens and aperture camera model for synthetic image generation". Computer Graphics (Proceedings SIGGRAPH'81), 15(3) 297-305, Aug. 1981.


reference:
R. L. Cook, T. Porter, and L. Carpenter. "Distributed ray tracing". Computer Graphics (Proceedings SIGGRAPH'84), 18(3) 137-145, July 1984.


reference:
H. Lieberman. "A multi-scale, multi-layer, translucent virtual space". In IEEE International Conference on Information Visualization, London, Sept. 1997. IEEE.


reference:
M. Kreuseler, N. Lopez, and H. Schumann. "A scalable framework for information visualization". In Proc. Information Vizualization, Salt Lake City, USA, Oct. 2000. IEEE.


reference:
M. Sarkar and M. H. Brown. "Graphical fisheye views". Communications of the ACM, 37(12) 73-83, Dec. 1994.


reference:
L. Westover. "Footprint evaluation for volume rendering". Computer Graphics (Proceedings SIGGRAPH'90), 24(4) 367-376, Aug. 1990.


reference:
A. Treisman. "Preattentive processing in vision". Computer Vision, Graphics, and Image Processing, 31 156-177, 1985.


reference:
A. Adams. "The Camera". Little Brown & Company, 1991.


reference:
G. Colby and L. Scholl. "Transparency and blur as selective cues for complex visual information". In SPIE Vol. 1460, Image Handling and Reproduction Systems Integration, pages 114-125, 1991.


reference:
E. B. Goldstein. "Sensation and Perception". Brooks/Cole Publishing Company, 5th edition, June 1998.


reference:
S. D. Katz. "Film directing shot by shot Visualizing from concept to screen". Focal Press, 1991.


reference:
H.-C. Lee. "Review of image-blur models in a photographic system using principles of optics". Optical Engineering, 29(5) 405-421, May 1990.


reference:
K. Matkovic, L. Neumann, and W. Purgathofer. "A survey of tone mapping techniques". In Proceedings of the Thirteenth Spring Conference on Computer Graphics, pages 163-170, Budimerce, Slovakia, 1997. Comenius University.


reference:
T. McReynolds and D. Blythe. "Advanced graphics programming techniques using OpenGL". SIGGRAPH 2000 Course 32, Course Notes, 2000.


reference:
S. E. Wixson. "Four-dimensional processing tools for cardiovascular data". IEEE Computer Graphics and Applications, 3(5) 53-59, Aug. 1983.


reference:
S. E. Wixson. "The display of 3d MRI data with non-linear focal depth cues". In Computers in Cardiology, pages 379-380. IEEE, Sept. 1990.


reference:
K. Misue, P. Eades, W. Lai, and K. Sugiyama. "Layout adjustment and the mental map". Journal of Visual Languages and Computing, 6(2) 183-210, June 1995.


reference:
Olsen, K. A., Korfhage, R. R., Sochats, K. M., Spring, M. B., & Williams, J. G. (1993). "Visualization of a Document Collection the VIBE System", Information Processing & Management, 29(1), 69-81.


reference:
Spoerri, A. (1993). "InfoCrystal A Visual Tool for Information Retrieval", in Proc. Visualization '93, IEEE Computer Society Press, Los Alamitos, 150-157.


reference:
Hemmje, M., Kunkel, C., and Willett, A. (1994) "LyberWorld - a Visualization User Interface Supporting Fulltext Retrieval", in Proc. Seventeenth Annual International ACM SIGIR Conference (TREC-1), 1-20.


reference:
Hearst, M. (1995) "TileBars Visualization of Term Distribution Information in Full Text Information Access", in Proc. ACM SIGCHI '95, 59-66.


reference:
Mackinlay, J. (1986) "Automating the Design of Graphical Presentations of Relational Information", Transactions on Graphics, 5(2), 110-141.


reference:
Veerasamy, A. and Belkin, N. "Evaluation of a Tool for Visualization of Information Retrieval Results", in Proc. SIGIR '96, 85-92.


reference:
Spence, Robert. (2001) "Information Visualization". ACM Press, New York, 85-88.


reference:
Miller, N., Wong, P, Brewster, M, & Foote, H. (1998) "TOPIC ISLANDS(TM) - A Wavelet-Based Text Visualization System", in Proc. IEEE Visualization '98, ACM Press, 189-196.


reference:
Zobel, J. (1998) "How Reliable Are the Results of Large-Scale Information Retrieval Experiments?", Proc. SIGIR '98, 307-314.


reference:
Hetzler, B. Whitney, P., Martucci, L., Thomas, J. "Multi-faceted Insight Through Interoperable Visual Information Analysis Paradigms", in Proc. IEEE Symposium on Information Visualization, InfoVis '98, October 19-20, 1998, Research Triangle Park, North Carolina, 137-144.


reference:
Carswell, C. Melody. (1992) "Choosing Specifiers An Evaluation of the Basic Tasks Model of Graphical Perception", Human Factors, 34(5), 535-554.


reference:
Cleveland, W. S. and McGill, R. (1985) "Graphical Perception and Graphical Methods for Analyzing Scientific Data", Science, 229(August), 828-833.


reference:
Morse, E. "Evaluation of Visual Information Browsing Displays", PhD Dissertation, Univ. of Pittsburgh, 1999.


reference:
Toms, E. (1998). "Information Exploration of the Third Kind The Concept of Chance Encounters". Presented at Information Exploration Workshop for SIGCHI '98.


reference:
Wilkinson, L. "The Grammar of Graphics", Springer-Verlag, New York, 1999.


reference:
Robertson G., Card S., Mackinlay J. "Cone Trees Animated 3D Visualizations of Hierarchical Information", Proc. ACM CHI Int. Conf. on Human Factors in Computing, 1991, pp. 189-194.


reference:
Ahlberg C., Williamson C., Shneiderman B. "Dynamic Queries for Information Exploration An Implementation and Evaluation", Proc. ACM CHI Int. Conf. on Human Factors in Computing, Monterey, CA, 1992, pp. 619-626.


reference:
Lamping J., Rao R., Pirolli P. "A Focus + Context Technique Based on Hyperbolic Geometry for Visualizing Large Hierarchies", Proc. ACM CHI Conf. on Human Factors in Computing (CHI95), 1995, pp. 401-408.


reference:
Eick S., Wills G. J. "Navigating Large Networks with Hierarchies", Proc. Visualization '93, San Jose, CA, 1993, pp. 204-210.


reference:
Keim D. A., Kriegel H. P. "VisDB Database Exploration using Multidimensional Visualization", Computer Graphics & Applications, Sept. 1994, pp. 40-49.


reference:
Keim D. A., Kriegel H. P., Ankerst M. "Recursive Pattern A Technique for Visualizing Very Large Amounts of Data", Proc. Visualization '95, Atlanta, GA, 1995, pp. 279-286.


reference:
Hao M, Dayal Umesh.U, Hsu M., D'eletto B., Becker J. "A Java-based Visual Mining Infrastructure and Applications", IEEE InfoVis99, San Francisco, CA. 1999.


reference:
Sarkar M., Brown M. "Graphical Fisheye Views", Communications of the ACM, Vol. 37, No. 12, 1994, pp. 73-84.


reference:
LeBlanc J., Ward M. O., Wittels N. "Exploring N-Dimensional Databases", Proc. Visualization '90, San Francisco, CA, 1990, pp. 230-237.


reference:
Beddow J. "Shape Coding of Multidimensional Data on a Mircocomputer Display", Proc. Visualization '90, San Francisco, CA, 1990, pp. 238-246.


reference:
Inselberg A., Dimsdale B. "Parallel Coordinates A Tool for Visualizing Multi-Dimensional Geometry", Proc. Visualization '90, San Francisco, CA, 1990, pp. 361-370.


reference:
Buja A., McDonald J. A., Michalak J., Stuetzle W. "Interactive Data Visualization Using Focusing and Linking", Proc. Visualization '91, San Diego, CA, 1991, pp. 156-163.


reference:
Stephen G. Eick "Visualizing Multi-dimensional Data with ADVISOR/2000", Visualinsights, 1999.


reference:
Anupam V., Dar S., Leibfried T., Petajan E. "DataSpace 3-D Visualization of Large Databases", Proc. Int. Symp. on Information Visualization, Atlanta, GA, 1995, pp. 82-88.


reference:
Pickett R. M., Grinstein G. G. "Iconographic Displays for Visualizing Multidimensional Data", Proc. IEEE Conf. on Systems, Man and Cybernetics, IEEE Press, Piscataway, NJ, 1988, pp. 514-519.


reference:
Ankers M., Keim D. A., Kriegel H.P. "Circle Segments A Technique for Visually Exploring Large Multidimensional Data Sets", VISUALIZATION '96, HOT TOPIC SESSION, San Francisco, CA, 1996.


reference:
Inselberg A. "The Plane with Parallel Coordinates", Special Issue on Computational Geometry, The Visual Computer, Vol. 1, 1985, pp. 69-97.


reference:
M. Sarkar, S. S. Snibbe, O. J. Tversky, and S. P. Reiss. "Stretching the Rubber Sheet A Methaphor for Visualizing Large Layouts on Small Screens". In Proceedings of the ACM Symposium on User Interface Software and Technology, pages 81-91, 1993.


reference:
M. C. Stone, K. Fishkin, and E. A. Bier. "The Movable Filter as a User Interface Tool". In Proceedings of the ACM CHI '94, pages 306-312. Association for Computing Machinery, 1994.


reference:
G.W. Furnas. "Generalized Fisheye Views". In Proceedings of the ACM CHI '86, pages 16-23. Association for Computer Machinery, 1986.


reference:
T. A. Keahey. "The Generalized Detail-In-Context Problem". In Proceedings of the IEEE InfoVis 1998. IEEE Computer Society Press, 1998.


reference:
R. Kosara, S. Miksch, and H. Hauser. "Semantic Depth of Field". In Proceedings of the IEEE InfoVis 2001, pages 97-104. IEEE Computer Society Press, 2001.


reference:
K. Matkovic, H. Hauser, R. Sainitzer, and M. E. Gröller. "Process Visualization with Levels of Detail". Technical Report TR-VRVIS-2002-016, VRVis Research Centar, Vienna, 2002.


reference:
M. Sarkar and M. H. Brown. "Graphical Fisheye Views". Communications of the ACM, 37(12) 73-83, Dec. 1994.


reference:
D. Baraff and A. Witkin. "Physically Based Modeling Principles and Practice". In Siggraph '99 Course Notes, 1999.


reference:
W. Rieger. "Neue Strategien für Interaktive Processvisualisierung". Master's thesis, Vienna University of Technology, 2002.


reference:
"TTTech Computertechnik AG", http //www.tttech.com.


reference:
B. Shneiderman. "Tree visualization with tree-maps A 2-D space-filling approach". ACM Transactions on Graphics, 11(1) 92-99, January 1992.


reference:
M. Chalmers, "A linear iteration layout algorithm for visualizing high-dimensional data". In Proc. of IEEE Visualization, 1996, pages 127-132.


reference:
B. dasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang. "On distances between phylogenetic trees". In Proceedings of the 8th ACM-SIAM Symposium of Discrete Algorithms, pages 427-436, 1997.


reference:
R.A. Becker and W.S. Cleveland. "Brushing Scatterplots". Technometrics 29 127-142 (1987). Reprinted in Dynamic Graphics for Data Analysis, edited by W. S. Cleveland and M. E. McGill, Chapman and Hall, New York, 1988.


reference:
T. Munzner, "Drawing large graphs with H3Viewer and Site Manager". In Proceedings of the Symposium on Graph Drawing, 1998, pages 384-393.


reference:
B. Allen and M. Steel. "Subtree transfer operations and their induced metric on evolutionary trees". Annals of combinatorics, in press.


reference:
I. Borg and P. Groenen, "Modern Multidimensional Scaling", Springer, 1997.


reference:
A. Buja, D. F. Swayne, M. Littman, N. Dean, H. Hofmann, "XGvis Interactive Data Visualization with Multidimensional Scaling", Journal of Computational and Graphical Statistics, to appear.


reference:
A. Buja, D.F. Swayne, and D. Cook. "Interactive high-dimensional data visualization". Journal of Computational and Graphical Statistics, 5(1) 78-99, 1996.


reference:
W. Day, "Optimal algorithms for comparing trees with labeled leaves" Journal of Classification 2 7-28. 1985.


reference:
W. P. Maddison and D.R. Maddison. "Mesquite a modular system for evolutionary analysis", version 0.96 beta. http //mesquiteproject.org


reference:
D.R. Maddison and W. P. Maddison, "MacClade version 4 Analysis of phylogeny and character evolution", Sinauer Associates, Sunderland Massachusetts, 2000.


reference:
Page, R. D. M. "TREEVIEW An application to display phylogenetic trees on personal computers". Computer Applications in the Biosciences 12 357-358, 1996.


reference:
Robinson, D.F. and L.R. Foulds. "Comparison of phylogenetic trees". Mathematical Biosciences, 53 131-147, 1981.


reference:
Robertson, G. G. Mackinlay, J. D. Card, S. K. "Cone Trees animated 3D visualizations of hierarchical information", Proc. Human factors in computing systems conference, March 1991, 189-194.


reference:
Ahlberg, C. and Shneiderman, B. "Visual Information Seeking Tight Coupling of Dynamic Query Filters with Starfield Display". Conference proceedings on Human factors in computing systems, April 1994, 313-318, ACM New York.


reference:
PROBLEM (some online references say pp. 517-523) Bier, E. A., Stone, M. C., Fishkin, K., Buxton, W., Baudel, T. "A Taxonomy of See-Through Tools", In Proceedings of CHI'94 ACM Conference on Human Factors in Computing Systems (Boston, MA, 24-28 April 1994), ACM Press, pp. 358-364.


reference:
Healey, C. G., Booth, K. S., and Enns, J, "Visualizing Real-Time Multivariate Data Using Preattentive Processing", ACM Transactions on Modeling and Computer Simulation 5, 3, 1995, 190-221.


reference:
Lamping J., Rao, R., Pirolli, P., "A focus+context technique based on hyperbolic geometry for visualizing large hierarchies", In Proceedings of the ACM SIGCHI Conference on Human Factors in Computing Systems. ACM, May 1995, 401-408.


reference:
Aliaga, D. "Visualization of Complex Models Using Dynamic Texture-Based Simplification", Proceedings of IEEE Visualization'96, Oct 27-Nov 1, pp. 101-106, 1996, IEEE, Piscataway, NJ.


reference:
Tanin, E., Beigel, R., and Shneiderman, B., "Incremental Data Structures and Algorithms for Dynamic Query Interfaces", SIGMOD Record (25) 4, 21-24, December 1996.


reference:
Veldhuizen, T. "Using C++ template metaprograms". C++ Report (7) 4, May 1995, 36-43.


reference:
Card, S. K., MacKinlay, J. D., Shneiderman, B., "Readings in Information Visualization Using Vision to Think", Morgan Kaufmann Publishers, 1998.


reference:
Fekete, J.-D. Plaisant, C. "Excentric Labeling Dynamic Neighborhood Labeling for Data Visualization", Proceedings of the CHI 99 conference on Human factors in computing systems, May 1999, 79-90.


reference:
Tufte, E. "The Visual Display of Quantitative Information". Graphics Press, Cheshire, CT, 1983.


reference:
Pook, S. Lecolinet, E. Vaysseix, G. Barillot, E. "Context and Interaction in Zoomable User Interfaces", Proceedings of the Working Conference on Advanced Visual Interfaces May 2000, 227-231.


reference:
Bederson, B., Shneiderman, B., Wattenberg, M. "Ordered and Quantum Treemaps Making Effective Use of 2D Space to Display Hierarchies", To appear in ACM Transactions on Computer Graphics.


reference:
Callahan, J., Hopkins, D., Weiser, M., Shneiderman, B. "An Empirical Comparison of Pie vs. Linear Menus", Proceedings on Human factors in computing systems May 1988. 95-100, ACM New York.


reference:
Cleveland, W.S., McGill, M.E., Eds., "Dynamic Graphics for Statistics". 1988


reference:
Jerding D. F., Stasko J. T., "The Information Mural A Technique for Displaying and Navigating Large Information Spaces", IEEE Transactions on Visualization and Computer Graphics, 4(3), July/September 1998, 257-271.


reference:
Yee, K.-P., Fisher, D.; Dhamija, R.; Hearst, M., "Animated exploration of dynamic graphs with radial layout". Proceeding of IEEE Symposium on Information Visualization 2001, IEEE Press, 2001, 43-50.


reference:
Nowell, L., Hetzler, E., Tanasse, T., "Change blindness in information visualization a case study". Proceeding of IEEE Symposium on Information Visualization 2001, IEEE Press, 200, 11-15.


reference:
Johnson, B. and Shneiderman, B. "Tree-maps A space-filling approach to the visualization of hierarchical information structures", Proc. IEEE Visualization '91 (1991) 284-291, IEEE, Piscataway, NJ.


reference:
Triesman, A. "Preattentive Processing in Vision". Computer Vision, Graphics, and Image Processing, 31 (1985) 156-177.


reference:
Baker, M. J. Eick, S. G. "Space Filling Software Visualization". Journal of Visual Languages and Computing, Vol. 6, 119-133, 1995.


reference:
Keim, D.A., "Visual Exploration of Large Data Sets Communications of the ACM", August 2001, Volume 44, Issue 8, 38-44.


reference:
North, C., Shneiderman, B., "Snap-Together Visualization Evaluating Coordination Usage and Construction", Int'l Journal of Human-Computer Studies special issue on Empirical Studies of Information Visualization, Volume 53, 5 (November 2000), 715-739.


reference:
Woo, M. Neider, J. Davis, T. and Shreiner, D. "OpenGL Programming Guide", Third Edition, Addison-Wesley, 2001.


reference:
Eick, S. G., Steffen, J. L., and Sumner, E. E. Jr. "SeeSoft - A Tool for Visualizing Line Oriented Software Statistics". IEEE Transactions on Software Engineering, 18 (11) 957-968, November 1992


reference:
D. Jerding and J. Stasko. "The Information Mural A technique for displaying and navigating large information spaces." IEEE Visualization `95 Symposium on Information Visualization, pp 43-50.


reference:
D. Wu, J. Roberge, D. J. Cork, B. G. Nguyen and T. Grace, "Computer visualization of long genomic sequences." IEEE Visualization '93, pp. 308-315.


reference:
Church, K.W., and Helfman, J.I. "Dotplot A Program for Exploring Self-Similarity in Millions of Lines of Text and Code", Proceedings of the 24th Symposium on the Interface, Computing Science and Statistics V24, pp. 58-67, March, 1992.


reference:
Hughes, Jason et al., "Computational identification of cis-regulatory elements associated with groups of functionally related genes in Saccharomyces cerevisiae." Journal of Molecular Biology (2000) 296 1205-124.


reference:
E. Hamori and J. Ruskin, "H-Curves, a novel method of representation of nucleotide sequences especially suited for long DNA sequences", Journal of Biological Chemistry, 258 (2) 1318-1327, 1983.


reference:
H. J. Jeffrey. "Chaos game representation of gene structure." Nucleic Acids Research, 18(8) 2163-2170, 1990.


reference:
Schenker, Heinrich, "Five graphic music analyses", New York Dover, 1969


reference:
"Saccharomyces genome database", http //genome-www.stanford.edu/Saccharomyces/ (2002)


reference:
"TimeSketch". ECS Media. www.ecsmedia.com 2002


reference:
M. Wattenberg, "The Shape of Song". http //www.turbulence.org/works/Song (2001)


reference:
Cooper, Geoffrey. "The Cell A Molecular Approach", 2nd ed. Sinauer Assoc. 2000.


reference:
U. M. Fayyad, G. P. Shapiro, P. Smyth, and R. Uthuruswamy, editors. "Advances in Knowledge discovery and Data Mining". MIT Press, 1996.


reference:
D. Cline and P. K. Egbert. "Interactive display of very large textures". In Proceedings of IEEE Visualization 1998, pages 343-350.


reference:
A. Floratos, I. Rigoutsos, L. Parida, G. Stolovitzky, and Y. Gao. "Sequence homology detection through large-scale pattern discovery". In Proceedings Third Annual ACM International Conference on Computational Molecular Biology, 1999.


reference:
D. Maier. "The complexity of some problems on subsequences and super sequences". Journal of ACM, 25 322-336, 1978.


reference:
L. Parida, I. Rigoutsos, A. Floratos, D. E. Platt, and Y. Gao. "Pattern discovery on character sets and real valued data Linear bound on irredundant motifs and an efficient polynomial time algorithm". In Proceedings 11th Annual ACM/SIAM Symposium on Discrete Algorithms, January 2000.


reference:
D. Gusfield, editor. "Algorithms on Strings, Trees, and Sequences Computer Science and Computational Biology". Cambridge University Press, 1997.


reference:
T. A. Keahey. "Getting along Composition of visualization paradigms". In Proceedings of IEEE InfoVis 2001.


reference:
D. Argenta, K. Bloch, H. Holyst, A. Moser, W. Rogers, D. Underwood, A. Vaidyanathan, and J. van Scekelenborg. "Tuples, tables & trees A new approach to the discovery of patterns in biological sequences". In Poster ISMB 2000.


reference:
T. L. Bailey and C. Elkan. "Fitting a mixture model by expectation maximization to discover motifs in biopolymers". In Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, pages 28-36. AAAI Press, 1994.


reference:
T. L. Bailey and M. Gribskov. "Combining evidence using pvalues application to sequence homology searches". Bioinformatics, 14 48-54, 1998.


reference:
A. Bairoch and R. Apweiler. "The swiss-prot protein sequence database and its supplement trembl in 2000". Nucleic Acids Research, 28 45-48, 2000.


reference:
A. Bairoch, L. Falquet, P. Bucher, and K. Hofmann. "The prosite database, its status in 1999". Nucleic Acids Research, 27 215-219, 1999.


reference:
H. M. Berman, J. Westbrook, Z. Feng, G. Gilliand, H. W. T. N. Bhat, I. N. Shindyalo, and P. Bourne. "The protein data bank". Nucleic Acids Research, 28 235-242, 2000.


reference:
A. Califano. "Splash structural pattern localization analysis by sequential histograms". Bioinformatics, 16(4) 341-357, 2000.


reference:
I. Rigoutsos and A. Floratos. "Combinatorial pattern discovery in biological sequences The TEIRESIAS algorithm". Bioinformatics, 14(1), 1998.


reference:
I. Rigoutsos, A. Floratos, Y. G. L. Parida, and D. Platt. "The emergence of pattern discovery techniques in computational biology". Metabolic Engineering, 2 159-177, 2000.


reference:
P. Thiagarajan. "Visual perspective to motif/pattern analysis". Master's thesis, University of Delaware, 2001.


reference:
J. C. Venter et al. "The sequence of the human genome". Science, 291 1304-1351, February 2001.


reference:
S. Weng. "PATMATCH, pattern matching software for saccharomyces genome database and arabidopsis thaliana database". URL http //genome-www2.stanford.edu/cgibin/AtDB/PATMATCH/nph-patmatch, 1998.


reference:
T. Zhao. "Xforms A graphical user interface toolkit for X". URL http //world.std.com/~xforms/ .


reference:
B. Myers, J. Goldstein, and M. Goldberg. "Creating charts by demonstration". In CHI '94, pages 106-111, 1994.


reference:
G. Lohse, K. Biolsi, and H. Rueter. "A classification of visual representations". Communications of the ACM, 37(12) 36-49, 1994.


reference:
J. Mackinlay. "Automating the design of graphical presentations of relational information". ACM Trans. on Graphics, 5(2) 110-141, 1986.


reference:
T. Mitchell. "Machine Learning". McGraw-Hill, 1997.


reference:
Y. Aslandogan, C. Their, C. Yu, and N. Rishe. "Using semantic contents and wordnet in image retrieval". In Proc. ACM SIGIR '97, pages 286-295, 1997.


reference:
M. Chuah, S. Roth, and S. Kerpedjiev. "Sketching, searching, and customizing visualizations A content-based approach to design retrieval". In M. Maybury, editor, Intelligent Multimedia Information Retrieval, pages 83-111. AAAI Press/The MIT Press, 1997.


reference:
M. Zhou and S. Feiner. "Visual task characterization for automated visual discourse synthesis". In Proc. ACM CHI '98, pages 292-299, 1998.


reference:
W. Ma and B. Manjunath. "A texture thesaurus for browsing large aerial photographs". J. of American Society for Information Science, 49(7) 633-648, May 1998.


reference:
R. Harris. "Information Graphics A Comprehensive Illustrated Reference". Management Graphics, 1996.


reference:
P. R. Keller and M. M. Keller. "Visual Cues Practical Data Visualization". IEEE Computer Society Press and IEEE Press, 1993.


reference:
M. Zhou and S. Feiner. "Data characterization for automatically visualizing heterogeneous information". In Proc. IEEE InfoVis '96, pages 13-20, 1996.


reference:
P. Wildbur and M. Burke. "Information Graphics Innovative Solutions in Contemporary Design". Thames and Hudson, 1998.


reference:
R. Duda and P. Hart. "Pattern Classification and Scene Analysis". Wiley, 1973.


reference:
M. Gleicher. "A Differential Approach to Graphical Interaction". PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213-3891, 1994.


reference:
J. Kolodner. "Case-based Reasoning". Morgan Kaufmann, 1993.


reference:
J. Levin, G. Anglin, and R. Carney. "On empirically validating functions of pictures in prose". In D. Willows and H. Houghton, editors, The Psychology of Illustration Basic Research, volume 1, chapter 2, pages 51-86. Springer-Verlag, New York, 1987.


reference:
J. Marks. "A formal specification scheme for network diagrams that facilitates automated design". J. of Visual Languages and Computing, 2(4) 395-414, 1991.


reference:
S. Tong and E. Chang. "Support vector machine active learning for image retrieval". In ACMMM '01, pages 107-118, 2001.


reference:
W3C, www.w3.org/TR/2001. "XML Schema", March 2001.


reference:
R. Wurman. "Information Architects". Graphics Press, New York, 1996.


reference:
M. Zhou. "Visual planning A practical approach to automated visual presentation". In Proc. IJCAI '99, pages 634-641, 1999.


reference:
M. Zhou and S. Ma. "Representing and retrieving visual presentations for example-based graphics generation". In Proc. 1st Intl. Syp. on Smart Graphics 2001, pages 87-94, 2001.


reference:
S. F. Roth and J. Mattis. "Automating the presentation of information". In Proc. IEEE Conf. on AI Applications, pages 90-97, 1991.


reference:
R. Hightower, L. Ring, J. Helfman, B. Bederson, and J. Hollan. "Graphical Multiscale Web Histories A Study of PadPrints". In Proc. ACM Conference on Hypertext, 1998, pp. 58-65.


reference:
E. Tufte. "The Visual Display of Quantitative Information". Cheshire, Connecticut Graphics Press, 1983.


reference:
D. Tang and M. Baker. "Analysis of a Local-Area Wireless Network". In Proc of the 6th International Conference on Mobile Computing and Networking, August 2000, pp. 1-10.


reference:
B. Bederson, J. Meyer, and L. Good. "Jazz An Extensible Zoomable User Interface Graphics Toolkit in Java". In Proc. UIST 2000, 2(2), 2000, pp.171-180.


reference:
J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh. "Data Cube A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals". In J. of Data Mining and Knowledge Discovery, 1(1), 1997, pp. 29-53.


reference:
Y. Fua, M. Ward, and E. Rundensteiner. "Structure-based Brushes A Mechanism for Navigating Hierarchically Organized Data and Information Spaces". In IEEE Trans. on Visualization and Computer Graphics, June 2000.


reference:
J. Abello and J. Korn. "MGV A System for Visualizing Massive Multidigraphs". In IEEE Trans. on Visualization and Computer Graphics, 8(1), January 2002, pp. 21-38.


reference:
C. Stolte, D. Tang, and P. Hanrahan. "Query, Analysis, and Visualization of Hierarchically Structured Data using Polaris". In Proc. ACM SIGKDD 2002, July 2002.


reference:
C. Stolte, D. Tang, and P. Hanrahan. "Polaris A System for Query, Analysis, and Visualization of Multi-dimensional Relational Databases". In IEEE Trans. on Visualization and Computer Graphics, 8(1), January 2002, pp. 52-65.


reference:
S. Eick and A. Karr. "Visual Scalability". In J. of Computational and Graphical Statistics, 11(1), March 2002, pp. 22-43.


reference:
M. Eisen, P. Spellman, P. Brown, and D. Botstein. "Cluster analysis and display of genome-wide expression patterns". In Proc Natl. Acad. Sci. USA 95, 1998, pp. 14863-8.


reference:
M. Eisen. "Cluster and Treeview". http //rana.lbl.gov.


reference:
E. Gamma, R. Helm, R. Johnson, and J. Vlissides. "Design Patterns Elements of Reusable Object-Oriented Software". Reading, MA Addison-Wesley, 1995.


reference:
E. Rundensteiner, M. Ward, J. Yang, and P. Doshi. "XmdvTool Visual Interactive Data Exploration and Trend Discovery of High-dimensional Data Sets". In Proc. ACM SIGMOD 2002, June 2002.


reference:
D. Tang. "Analyzing Wireless Networks". Ph.D. Dissertation, October 2000.


reference:
F. Topfer and W. Pillewizer. "The principles of selection, a means of carto graphic generalization". In Cartographic J., 3(1), 1966, pp. 10-16.


reference:
A. Woodruff, C. Olston, A. Aiken, M. Chu, V. Ercegovac, M. Lin, M. Spalding, and M. Stonebraker. "DataSplash A Direct Manipulation Environment for Programming Semantic Zoom Visualizations of Tabular Data". J. of Visual Languages and Computing, Special Issue on Visual Languages for End-user and Domain-specific Programming, 12(5), October 2001, pp. 551-571.


reference:
J. Bertin. "Semiology of Graphics Diagrams, Networks, Maps". Univ. of Wisconsin Press, 1983.


reference:
B. Bederson, J. Hollan, K. Perlin, J. Meyer, D. Bacon, and G. Furnas. "Pad++ A Zoomable Graphical Sketchpad for Exploring Alternate Interface Physics". In J. of Visual Languages and Computing, 7, 1996, pp. 3-31.


reference:
R. Bosch, C. Stolte, D. Tang, J. Gerth, M. Rosenblum, and P. Hanrahan. "Rivet A Flexible Environment for Computer Systems Visualization". In Computer Graphics, 34(1), February 2000.


reference:
Isakowitz, T., Stohr, E., Balasubramanian, P., "RMM a methodology for structured hypermedia design", Communications of the ACM, 38(8), pp. 34-44, (1995).


reference:
Mackinlay, J., "Automating the design of graphical presentations of relational information". ACM Trans. on Graphics 5(2), 111-141, (1986).


reference:
Livny, M., Ramakrishnan, R., Beyer, K., Chen, G., Donjerkovic, D., Lawande, S., Myllymaki, J., Wenger, K., "DEVise integrated querying and visual exploration of large datasets", Proc. ACM SIGMOD'97, pp. 301-312,(1997).


reference:
Baldonado, M., Woodruff, A., Kuchinsky, A., "Guidelines for Using Multiple Views in Information Visualization", Proc. Advanced Visual Interfaces, (2000).


reference:
Becker, R., Cleveland, W., "Brushing Scatterplots", Technometrics, 29(2), pp. 127-142, (1987).


reference:
Haeberli, P., "ConMan A Visual Programming Language for Interactive Graphics", Proc. ACM SigGraph '88, pp. 103-111, (1988).


reference:
Takatsuka, M. and Gahegan, M., "GeoVISTA Studio A Codeless Visual Programming Environment For Geoscientific Data Analysis and Visualization", The Journal of Computers & Geosciences, (2002).


reference:
Upson, C, Faulhaber, T, Kamins, D, Laidlaw D,Schlegel D, Vroom J, Gurwitz, R, van Dam, A, "The Application Visualization System A Computational Environment for Scientific Visualization", IEEE Computer Graphics and Applications, pp. 30-42, (July 1989).


reference:
Derthick, M., Roth, S.F., Kolojejchick, J., "Coordinating declarative queries with a direct manipulation data exploration environment", IEEE Information Visualization Symposium, pp. 65-72, (1997).


reference:
Aiken, A., Chen, J., Stonebraker, M., Woodruff, A., "Tioga-2 A Direct Manipulation Database Visualization Environment", Proc, 12th Intl. Conference on Data Engineering, pg. 208-217, (February 1996).


reference:
Philip Isenhour, James 'Bo' Begole, Winfield S. Heagy, and Clifford A. Shaffer, "Sieve A Java-Based Collaborative Visualization Environment", In IEEE Visualization '97, (October 1997).


reference:
North, C., Shneiderman, B., "Snap-Together Visualization Can Users Construct and Operate Coordinated Views?", Intl. Journal of Human Computer Studies, Academic Press, 53(5), pg. 715-739, (November 2000).


reference:
North, C., "Multiple Views and Tight Coupling in Visualization A Language, Taxonomy, and System", Proc. CSREA CISST 2001 Workshop on Fundamental Issues in Visualization, pp. 626-632, (2001).


reference:
Plaisant, C., Carr, D., Shneiderman, B., "Image browsers taxonomy, guidelines, and informal specifications", IEEE Software, 12(2), pp. 21-32, (March 1995).


reference:
Shaw, M. and Garlan, D., "Software Architecture Perspectives on an Emerging Discipline". Prentice Hall, Inc. (1996)


reference:
Shneiderman, B., "Supporting Creativity with Advanced Information-Abundant User Interfaces", in Human-Centered Computing, Online Communities, and Virtual Environments, Springer-Verlag, pp. 469-480, (2001).


reference:
Jacobson, A., Berkin, A., Orton, M., "LinkWinds interactive scientific data analysis and visualization", Communications of the ACM, 37(4), pp. 43-52, (April 1994).


reference:
Roth, S., Chuah, M., Kerpedjiev, S., Kolojejchick, J., Lucas, P., "Towards an Information Visualization Workspace Combining Multiple Means of Expression", Human-Computer Interaction Journal, 12(1&2), pp. 131-185, (1997).


reference:
Robert Bosch, Chris Stolte, Diane Tang, John Gerth, Mendel Rosenblum, and Pat Hanrahan. "Rivet A Flexible Environment for Computer Systems Visualization", Computer Graphics 34(1), (February 2000).


reference:
Chalmers, M., "A Linear Iteration Time Layout Algorithm for Visualising High-Dimensional Data", Proc IEEE Visualization '96, San Francisco, pp. 127-132 (1996).


reference:
Indyk, P., R. Motwani, "Approximate Nearest Neighbors - Towards Removing the Curse of Dimensionality", Proceedings of SIGMOD '98, pp. 307-318 (1998).


reference:
Rodden, K., W. Basalaj, D. Sinclair, K. Wood, "Does Organisation by Similarity Assist Image Browsing?", Proceedings of the SIGCHI on Human Factors in Computing Systems, pp. 190-197 (2001).


reference:
Chavez, E., J. L. Marroquin , G. Navarro, "Fixed Queries Array A Fast and Economical Data Structure for Proximity Searching", Multimedia Tools and Applications (MTAP), 14(2), pp. 113-135 (2001).


reference:
Gionis, A., P. Indyk, R. Motwani, "Similarity Search in High Dimensions via Hashing", Proceedings of 25th International Conference on Very Large Data Bases, pp. 518-529 (1999).


reference:
MacQueen, J., "Some Methods for Classification and Analysis of Multivariate Observations", Proc. 5th Berkeley Symposium on Mathematics and Probability, pp. 281-297 (1967).


reference:
Basalaj, W., "Proximity Visualisation of Abstract Data", PhD thesis, University of Cambridge Computer Laboratory (2000).


reference:
Brodbeck, D., L. Girardin, "Combining Topological Clustering and Multidimensional Scaling for Visualising Large Data Sets", Unpublished paper (accepted for, but not published in, Proc. IEEE Information Visualization 1998).


reference:
Chatfield, C., A. J. Collins, "Introduction to Multivariate Analysis", Chapman & Hall, London (1980).


reference:
Kohonen, T., S. Kaski, K. Lagus, J. Salojarvi, J. Honkela, V. Paatero, A. Saarela "Self-organization of a Massive Document Collection", IEEE Transactions on Neural Networks, 11(3), pp. 574-585, (2000).


reference:
Su, M.-C., H.-T. Chang, "Fast Self-Organizing Feature Map Algorithm", IEEE Transactions on Neural Networks, Vol. 11, No. 3, p. 721 (2000).


reference:
Fruchterman, T., E. Reingold. "Graph drawing by force-directed placement", Software-Practice and Experience, 21(11), pp. 1129-1164 (1991).


reference:
M. Juvan and B. Mohar, "Optimal linear labelings and eigenvalues of graphs", Discrete Applied Mathematics 36 (1992), 153-168.


reference:
D. Harel and Y. Koren, "A Fast Multi-scale Method for Drawing Large Graphs", Graph Drawing 2000, LNCS 1984, pp. 183-196, Springer Verlag, 2000.


reference:
J. W. Gardner and P. N. Bartlett, Electronic Noses, "Principles and Applications", Oxford University Press, New York, USA, 1999.


reference:
G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, "Graph Drawing Algorithms for the Visualization of Graphs", Prentice-Hall, 1999.


reference:
I. Herman, G. Melancon and M. S. Marshall, "Graph Visualisation and Navigation in Information Visualisation", IEEE Transactions on Visualization and Computer Graphics 6 (2000), 24-43.


reference:
A. Quigley and P. Eades, "FADE Graph Drawing, Clustering, and Visual Abstraction", Graph Drawing 2000, LNCS 1984, pp. 183- 196, Springer Verlag, 2000.


reference:
C. Walshaw, "A Multilevel Algorithm for Force-Directed Graph Drawing", Graph Drawing 2000, LNCS 1984, pp. 171-182, Springer Verlag, 2000.


reference:
D. Harel and Y. Koren, "Graph Drawing by High-Dimensional Embedding", to appear in Proceedings of Graph Drawing 2002, Springer Verlag.


reference:
J. Shi and J. Malik, "Normalized Cuts and Image Segmentation", IEEE Conference Computer Vision and Pattern Recognition, pp. 731-737, 1997.


reference:
Y. Koren, L. Carmel and D. Harel "ACE A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs", Technical Report MCS01-17, The Weizmann Institute of Science, 2001. Available at www.wisdom.weizmann.ac.il/reports.html.


reference:
P. Gajer, M. T. Goodrich, and S. G. Kobourov, "A Multidimensional Approach to Force-Directed Layouts of Large Graphs", Graph Drawing 2000, LNCS 1984, pp. 211-221, Springer Verlag, 2000.


reference:
S. T. Barnard and H. D. Simon, "A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems", Concurrency Practice & Experience 6 (1994), 101-117.


reference:
U. Brandes and T. Willhalm, "Visualizing Bibliographic Networks with a Reshaped Landscape Metaphor", Proc. 4th Joint Eurographics - IEEE TVCG Symp. Visualization (VisSym '02), pp. 159-164, ACM Press, 2002.


reference:
A. Brandt, "Algebraic Multigrid Theory The Symmetric Case", Applied Mathematics and Computation, 19 (1986) 23-56.


reference:
L. Carmel, Y. Koren and D. Harel, "Visualizing and Classifying Odors Using a Similarity Matrix", to appear in the 9th International Symposium on Olfaction and Electronic Nose (ISOEN02), September 29 - October 2, 2002.


reference:
R. Hadany and D. Harel, "A Multi-Scale Method for Drawing Graphs Nicely", Discrete Applied Mathematics 113 (2001), 3-21.


reference:
K. M. Hall, "An r-dimensional Quadratic Placement Algorithm", Management Science 17 (1970), 219-229.


reference:
M. Kaufmann and D. Wagner (Eds.), "Drawing Graphs Methods and Models", LNCS 2025, Springer Verlag, 2001.


reference:
Y. Koren "On Spectral Graph Drawing", manuscript, 2002.


reference:
C. C. Paige and M. A. Saunders, "Solution of Sparse Indefinite Systems of Linear Equations", SIAM J. Numer. Anal. 12 (1975), 617-629.


reference:
K. Stueben, "An Introduction to Algebraic Multigrid", Appendix A in Multigrid (U. Trottenberg, C.W. Oosterlee, and A. Schuller, eds.), Academic Press, London, 2000.


reference:
D. S. Watkins, "Fundamentals of Matrix Computations", John Wiley, New York, NY, USA, 1991.


reference:
J. D. Cohen. "Drawing graphs to convey proximity An incremental arrangement method". ACM Transactions on Computer-Human Interaction, 4(3) 197-229, 1997.


reference:
J. Branke. "Dynamic graph drawing". In M. Kaufmann and D. Wagner, editors, Drawing Graphs Methods and Models, LNCS Tutorial 2025 228-246. Springer, 2001.


reference:
R. Tamassia, M. T. Goodrich, L. Vismara, M. Handy, G. Shubina, R. F. Cohen, B. Hudson, R. S. Baker, N. Gelfand, and U. Brandes. "JDSL The data structures library in Java". Dr. Dobb's Journal, 323 21-31, April 2001.


reference:
I. Herman, G. Melancon, and M. S. Marshall. "Graph visualization and navigation in information visualization a survey". IEEE Transactions on Visualization and Computer Graphics, 6(1) 24-43, 2000.


reference:
S. Havre, E. Hetzler, P. Whitney, and L. Nowell. "ThemeRiver Visualizing thematic changes in large document collections". IEEE Transactions on Visualization and Computer Graphics, 8(1) 9-20, 2002.


reference:
U. Brandes and D. Wagner. "A Bayesian paradigm for dynamic graph layout". In Proc. 5th Intl. Symp. Graph Drawing (GD '97), LNCS 1353 236-247. Springer, 1997.


reference:
C. Friedrich and M. E. Houle. "Graph drawing in motion II". Proc. 9th Intl. Symp. Graph Drawing (GD '01), LNCS 2265 220-231. Springer, 2002.


reference:
U. Brandes, P. Kenis, and D. Wagner. "Communicating centrality in policy network drawings". IEEE Transactions on Visualization and Computer Graphics, 2002. To appear.


reference:
K.-P. Yee, D. Fisher, R. Dhamija, and M. Hearst. "Animated exploration of dynamic graphs with radial layout". Proc. IEEE Symp. Information Visualization 2001 (INFOVIS '01), pages 32-50, 2001.


reference:
J.M. Anthonisse. "The rush in a directed graph". Technical Report BN 9/71, StichtingMathematisch Centrum, Amsterdam, Oct. 1971.


reference:
U. Brandes. "A faster algorithm for betweenness centrality". Journal of Mathematical Sociology, 25(2) 163-177, 2001.


reference:
E. W. Brown, S. Srinivasan, A. Coden, D. Ponceleon, and J. W. Cooper. "Toward speech as a knowledge resource". Knowledge Management, 40(4), 2001.


reference:
K. M. Carley. "Network text analysis The network position of concepts". In C. W. Roberts, editor, Text Analysis for the Social Sciences Methods for Drawing Statistical Inferences from Texts and Transcripts, pages 79-100. Lawrence Erlbaum Associates, 1997.


reference:
S. R. Corman, T. Kuhn, R. D. McPhee, and K. J. Dooley. "Studying complex discursive systems Centering resonance analysis of communication". Human Communication Research, 28(2) 157-206, 2002.


reference:
L. C. Freeman. "A set of measures of centrality based on betweenness". Sociometry, 40 35-41, 1977.


reference:
L. Stafford, V. R. Waldron, and L. L. Infield. "Actor-observer differences in conversational memory". Human Communication Research, 15 590-611, 1989.


reference:
T. Kamada and S. Kawai. "An algorithm for drawing general undirected graphs". Information Processing Letters, 31 7-15, 1989.


reference:
K. Misue, P. Eades, W. Lai, and K. Sugiyama. "Layout adjustment and the mental map". Journal on Visual Languages and Computing, 6(2) 183-210, 1995.


reference:
Rao, R., and Card, S. "The Table Lens Merging Graphical and Symbolic Representations in an Interactive Focus+Context Visualization for Tabular Information". Proc ACM SIGCHI, pp. 318-322, 1994.


reference:
Furnas, G., and Zacks, J., "Multitrees Enriching and reusing hierarchical structure". Proc. ACM SIGCHI, pp. 330-336, 1994.


reference:
Spenke, M., Beilken, C., and Berlage, T. "FOCUS The Interactive Table for Product Comparison and Selection". Proc ACM UIST, 1996.


reference:
Spence, R., "Information Visualization", ACM Press, 2000.


reference:
Chi, E., Pitkow, J., Mackinlay, J., Pirolli, P., Gossweiler, R., and Card, S. "Visualizing the evolution of web ecologies". Proc. ACM SIGCHI, pp. 400-407, 1998.


reference:
Graham, M., Kennedy, J., and Hand, C., "A comparison of set-based and graph-based visualizations of overlapping classification hierarchies". Proc. ACM AVI, pp. 41-50, 2000.


reference:
Becker, R. and Cleveland, W. "Brushing scatterplots". Technometrics, 29(2), pp. 127-142, 1987.


reference:
Roth, S., Lucas, P., Senn, J., Gomberg, C., Burks, M., Stroffolino, P., Kolojejchick, J., Dunmire, C., "Visage A user interface environment for exploring information". Proc IEEE Information Visualization, pp. 3-13, 1996.


reference:
Chi, E., Barry, P., Riedl, J., Konstan, J., "A Spreadsheet Approach to Information Visualization". Proc. IEEE Information Visualization, pp. 17-24, 1997.


reference:
Stolte, C., and Hanrahan, P., "Polaris A System for Query, Analysis and Visualization of Multi-dimensional Relational Databases". Proc IEEE Information Visualization, 2000.


reference:
"COMPUSTAT Industrial Annual database", http //www.compustat.com/, Standard and Poor, 2001.


reference:
Robertson, G., Cameron, K., Czerwinski, C., Robbins, D., "Polyarchy Visualization Visualizing Multiple Intersecting Hierarchies". Proc. ACM SIGCHI, 2002.


reference:
Ross, S., "Fundamentals of Corporate Finance", McGraw Hill, 2000.


reference:
G. W. Furnas. "Generalized fisheye views". In Proc. of the ACM CHI '86 Conf. on Human Factors in Computing Systems, pages 16-23, 1986.


reference:
R. Becker and W. Cleveland. "Brushing scatterplots". Technometrics, 29(2) 127-142, 1987.


reference:
D. Gresh et al. "WEAVE A system for visually linking 3-D and statistical visualizations, applied to cardiac simulation and measurement data". In IEEE Vis. 2000, pages 489-492.


reference:
A. Martin and M. O. Ward. "High dimensional brushing for interactive exploration of multivariate data". In Proc. of IEEE Visualization '95, pages 271-278.


reference:
A. Inselberg and B. Dimsdale. "Parallel coordinates a tool for visualizing multidimensional geometry". In Proc. of IEEE Visualization '90, pages 361-378.


reference:
M. O. Ward. XmdvTool "Integrating multiple methods for visualizing multivariate data". In Proc. of IEEE Visualization '94, pages 326-336.


reference:
H. Doleisch and H. Hauser. "Smooth brushing for focus+ context visualization of simulation data in 3D". In Proc. of WSCG 2002, pages 147-154, Plzen, Czech Rep.


reference:
A. Inselberg. "A survey of parallel coordinates". In H.-C. Hege and K. Polthier, editors, Mathematical Visualization, pages 167-179. Springer Verlag, Heidelberg, 1998.


reference:
E. P. Klement, R. Mesiar, and E. Pap. "Triangular Norms", volume 8 of Trends in Logic. Kluwer Acad. Publ., 2000.


reference:
P. Vlachos and M. Meyer. "StaLib - data, software and news from the statistics community". http //lib.stat.cmu.edu/, 2002.


reference:
G. J. Wills. "524,288 ways to say 'this is interesting'". In Proc. of IEEE Symp. on Information Visualization, pages 54-61, 1996.


reference:
T. Munzner and P. Burchard. "Visualizing the structure of the World WideWeb in 3D hyperbolic space". In VRML Conference Proceedings, 1995.


reference:
E. H. Chi, J. Pitkow, J. Mackinlay, P. Pirolli, R. Gossweiler, and S. K. Card. "Visualizing the evolution of web ecologies". In Proc. of ACM CHI 98 Conference on Human Factors in Computing Systems, 1998.


reference:
S. Lawrence and C. L. Giles. "Accessibility of information on the web". Nature, 400(6740) 107-109, 1999.


reference:
P. Berkhin, J. D. Becher, and D. J. Randall. "Interactive path analysis of web site traffic". In KDD-2001 Proceedings, pages 414-419, San Francisco, California, 2001. ACM.


reference:
T. Mah, H. Hoek, and Y. Li. "Funnel report mining for the msn network". In KDD-2001 Proceedings, pages 450-455, San Francisco, California, 2001. ACM.


reference:
G. D. Battista, P. Eades, R. Tamassia, and I. G. Tollis. "Graph Drawing Algorithms for the Visualization of Graphs". Prentice Hall, 1999.


reference:
J. Brainerd and B. Becker. "E-commerce clickstream visualization". pages 153-156, 2001.


reference:
R. Cooley, P. N. Tan, and J. Srivastava. "Websift the web site information filter system". In Proceedings 1999 KDD Workshop on Web Mining, San Diego, California, 1999. Springer-Verlag.


reference:
B. Huberman, P. Pirolli, J. Pitkow, and R. Lukose. "Strong regularities in world wide web surfing". Science, 280 95-97, 1997.


reference:
R. Kimball and R. Merz. "The Data Webhouse Toolkit". John Wiley & Sons, Inc., New York, New York, 2000.


reference:
A. Nanopoulos, D. Katsaros, and Y. Manolopoulos. "Effective prediction of web-user accesses A data mining approach". In R. Kohavi, B. Masand, M. Spiliopoulou, and J. Srivastava, editors, WEBKDD 2001 Working Notes, pages 1-12. AC Press, 2001.


reference:
M. Spiliopoulou, C. Pohle, and L. Faulstich. "Improving the effectiveness of a web site with web usage mining". In Proceedings 1999 KDD Workshop on Web Mining, San Diego, California, 1999. Springer-Verlag. In Press.


reference:
E. Thomsen. "OLAP Solutions". John Wiley & Sons, Inc., New York, New York, 1997.


reference:
Shneidermann, B., "Tree visualization with tree-maps 2-d space-filling approach", ACM Transactions on Graphics, January 1992, vol 11, no.1, pp. 92-99.


reference:
Becker, A., and Cleveland, W.S., "Brushing Scatterplots". Technometrics, May 1987, vol. 29, no. 2, pp. 127-142.


reference:
Wattenberg, M., "Visualizing the Stock Market", CHI'99 Extended Abstracts, Pittsburgh, Philadelphia, 1999, ACM, p.188-189.


reference:
Weber, M., Alexa, M., Muller,W., "Visualizing Time-Series on Spirals", IEEE Symposium on Information Visualization, 2001.


reference:
Konrad, R, "VCs turn off the tap on funding". CNET News.


reference:
Eick, S.G., Steffen, J.L., and Sumner Jr., E.E., "Seesoft - A Tool for Visualization Line Oriented Software Statistics", IEEE Transactions on Software Engineering, 1992, p.957-968.


reference:
G. G. Robertson, J. D. Mackinlay, and S. K. Card, "Cone Trees Animated 3D Visualizations of Hierarchical Information", Human Factors in Computing Systems, CHI '91 Conference Proceedings, ACM Press, 1991, pp. 189-194.


reference:
G.G. Robertson, S.K. Card, and J.D. Mackinlay, "Information Visualization Using 3D Interactive Animation", Communications of the ACM, 36(4), 1993, pp. 57-71.


reference:
Huai-hsin Chi, James Pitkow, Jock Mackinlay, Oeter Pirolli, Rich Gossweiler, Stuart K. Card, "Visualizing the Evolution of Web Ecologies", In Proceeding of ACM CHI 98 Conference on Human Factors in Computing Systems, ACM Press, 1998. Los Angeles, California, pp. 400-407, 644-645.


reference:
G. W. Furnas, X. Zhang, "MuSE A Multi-Scale Editor", In Proceeding of the UIST'98 Symposium, ACE Press, 1998.


reference:
C. S Jeong and A. Pang, "Reconfigurable Disc Trees for Visualizing Large Hierarchical Information Space", In Proceedings of the IEEE Symposium on Information Visualization (InfoVis '98), IEEE CS Press, 1998.


reference:
Johnson, Brian, and Shneiderman, Ben, "Tree-maps A space-filling approach to the visualization of hierarchical information structures", In Proceedings of the 1991 IEEE Visualization, IEEE, Piscataway, NJ, 1991, pp. 284-291.


reference:
P. Eades, "Drawing Free Trees", Bulletin of the Institute for Combinatorics and its Applications, 1992, pp. 10-36.


reference:
I. Herman, G. Melançon, M.S. Marshall. "Graph Visualisation in Information Visualisation a Survey". In IEEE Transactions on Visualization and Computer Graphics, 6(1), pp. 24-44 (2000).


reference:
Quingwen Feng, "Algorithms for Drawing Clustered Graphs", Thesis of Doctor of Philosophy, The Department of Computer Science and Software Engineering, The University of Newcastle, Australia, April 1997.


reference:
Hal Burch, Bill Cheswick, "Internet Mapping Project", Bell Labs, http //www.cs.bell-labs.com/who/ches/map/index.html


reference:
Y. Shiloach, "Arrangements of Planar Graphs on the Planar Lattices", PhD Thesis, Weizmann Institute of Science, Rehovot, Israel, 1976.


reference:
G. di Battista, P. Eades, R. Tamassia, and I. G. Tollis, "Graph Drawing", IEEE Transactions on Visualization and Computer Graphics, 1(1), 1995, pp. 16-28.


reference:
Ben Shneiderman, "Treemaps for Space-Constrained Visualization of Hierachies", December 26, 1998, updated November 30, 2001. http //www.cs.umd.edu/hcil/treemaps.


reference:
Hideki Koike, Hirotaka Yoshihara, "Fractal Approaches for Visualizing Huge Hierarchies", In Proceedings of the 1993 IEEE Symposium on Visual Languages, IEEE/CS, 1993, pp. 55-60.


reference:
E. M. Reingold and J. S. Tilford, "Tidier Drawing of Trees", IEEE Transactions on Software Engineering, SE-7(2), 1981, pp. 223-228.


reference:
Graham J Wills, "NicheWorks - Interactive Visualization of Very Large Graphs", Lucent Technologies (Bell Laboratories), USA. http //www.belllabs.com/user/gwills/NICHEguide/nichepaper.html.


reference:
J. Lamping and R. Rao, "The Hyperbolic Browser A Focus + Context Technique for Visualizing Large Hierarchies", Journal of Visual Languages and Computing, vol. 7, no. 1, 1995, pp. 33-55.


reference:
S. Card, G. Robertson, and J. Mackinlay. "The information visualizer, an information workspac". Proc. of ACM CHI'91, Conference on Human Factors in Computing Systems, p. 181-188, 1991.


reference:
G. Robertson, J. Mackinlay, and S. Card. "Cone trees Animated 3d visualization of hierarchical information". Proc. of Computer-Human Interaction '91, p. 189-194, 1991.


reference:
T. Munzner and P. Burchard. "Visualizing the structure of the world wide web in 3d hyperbolic space". Proceedings of the VRML95 Symposium, ACM SIGGRAPH, 1995.


reference:
R. Rao and S. Card. "Exploring large tables with the table lens". Proc. of ACM CHI'95 Conference on Human Factors in Computing Systems, Vol. 2, p. 403-4, 1995.


reference:
J. Lamping, R. Rao, and P. Pirolli. "A focus+context technique based on hyperbolic geometry for visualizing large hierarchies". Human Factors in Computing Systems, CHI 95 Conference Proceedings, 1995.


reference:
Y. Fua, M. Ward, and E. Rundensteiner. "Hierarchical parallel coordinates for exploration of large datasets". Proc. of Visualization '99, p. 43-50, Oct. 1999.


reference:
J. Stasko, R. Catrambone, M. Guzdial, and K. Mcdonald. "An evaluation of space-filling information visualizations for depicting hierarchical structures". Int. J. Human-Computer Studies, Vol. 53, p. 663-694, 2000.


reference:
G. D. Battista, P. Eades, R. Tamassia, and I. Tollis. "Graph Drawing Algorithms for the Visualization of Graphs". Upper Saddle River, N.J Prentice Hall, 1999.


reference:
M. Chuah. "Dynamic aggregation with circular visual designs". Proc. of Information Visualization '98, p. 35-43, 1998.


reference:
T. Munzner. "Drawing large graphs with h3viewer and site manager". Proceedings of the Symposium on Graph Drawing GD 98, p. 384-393, 1998.


reference:
J. Yang, M. O. Ward, and E. A. Rundensteiner. "Visual hierarchical dimension reduction for exploration of high dimensional datasets". Technical Report WPICS-TR-02-22, 2002.


reference:
H. Koide and H. Yoshihara. "Interacting with huge hierarchies Beyond cone trees". Proc. of Information Visualization '95, p. 74-81, 1995.


reference:
T. Munzner. "H3 Laying out large directed graphs in 3d hyperbolic space". Proceedings of the 1997 IEEE Symposium on Information Visualization, p. 2-10, 1997.


reference:
Y. Fua, M.Ward, and E. Rundensteiner. "Navigating hierarchies with structure-based brushes". Proc. of Information Visualization '99, p. 58-64, Oct. 1999.


reference:
J. van Wijk and H. van de Wetering. "Cushion treemaps Visualization of hierarchical information". Proc. of Information Visualization 1999, p. 73-78, 1999.


reference:
J. Stasko and E. Zhang. "Focus+context display and navigation techniques for enhancing radial, space-filling hierarchy visualization". Proc. of Information Visualization 2000, p. 57-65, 2000.


reference:
F. van Ham, H. van de Wetering, and J. van Wijk. "Visualization of state transition graphs". Proc. of Information Visualization 2001, p. 59-66, 2001.


reference:
R. Dachselt and J. Ebert. "Collapsible cylindrical trees A fast hierarchical navigation technique". Proc. of Information Visualization 2001, p. 79-86, 2001.


reference:
E. Kleiberg, H. van de Wetering, and J. van Wijk. "Botanical visualization of huge hierarchies". Proc. of Information Visualization 2001, p. 87-94, 2001.


reference:
B. Shneiderman and M. Wattenberg. "Ordered treemap layouts". Proc. of Information Visualization 2001, p. 73-78, 2001.


reference:
T. Barlow and P. Neville. "A comparison of 2-d visualization of hierarchies". Proc. of Information Visualization 2001, p. 131-138, 2001.


reference:
A. Bruggemann-Klein and D. Wood. "Drawing trees nicely with tex". Electronic Publishing, 2(2), p. 101-115, 1989.


reference:
B. Johnson and B. Shneiderman. "Tree maps A space-filling approach to the visualization of hierarchical information structures". Proc. of Visualization '91, p. 284-91, 1991.


reference:
B. Kleiner and J. Hartigan. "Representing points in many dimensions by trees and castles". Journal of the American Statistical Associatioin, June 1981, p. 260-272, 1981.


reference:
P. Eades. "Drawing the trees". Bulletin of the Institute of Combinatorics and its Applications, p. 10-36, 1992.


reference:
K.-P. Yee, D. Fisher, R. Dhamija, and M. Hearst. "Animated exploration of graphs with radial layout". Proc. of Information Visualization 2001, p. 43-50, 2001.


reference:
H. Koide and H. Yoshihara. "Fractal approaches for visualizing huge hierarchies". Proc. of the 1993 IEEE Symposium on Visual Languages, p. 55-60, 1993.


reference:
I. Herman, M. S. Marshall, G. Melancon, D. Duke, M. Delest, and J.-P. Domenger. "Skeletal images as visual cues in graph visualization". Data Visualization' 99, p. 13-22, 1999.


reference:
K. Andrews and H. Heidegger. "Information slices Visualising and exploring large hierarchies using cascading, semicircular discs". IEEE Information Visualization Symposium 1998, Late Breaking Hot Topics Paper, p. 9-12, 1998.


reference:
J. Lamping and R. Rao. "The hyperbolic browser A focus+context technique for visualizing large hierarchies". Journal of Visual Languages and Computing, Vol. 7 No. 1, p. 33-55, 1996.


reference:
P. Irani, M. Tingley and C. Ware, "Using Perceptual Syntax to Enhance Semantic Content in Diagrams", IEEE Computer Graphics and Applications, September/October 2001, IEEE CS Press, pp 76-85.


reference:
J.J. van Wijk and H.M.M. van de Wetering, "Cushion Treemaps Visualization of Hierarchical Information", Proceedings of IEEE Symposium on Information Visualization 1999, IEEE CS Press, pp 73-78, 1999.


reference:
B. Shneiderman and M. Wattenberg, "Ordered Treemap Layouts", Proceedings of IEEE Symposium on Information Visualization 2001, IEEE CS Press, pp 73-78.


reference:
T. Barlow and P. Neville, "A Comparison of 2-D Visualizations of Hierarchies", Proceedings of IEEE Symposium on Information Visualization 2001, IEEE CS Press, pp 131-138, 2001.


reference:
B. Johnson and B. Shneiderman, "Tree-Maps A Space-Filling Approach to the Visualization of Hierarchical Information Structures", Proceedings of IEEE Visualization '91 Conference, IEEE CS Press, pp 284-291, 1991.


reference:
D. M. Bruls, C. Huizing, J.J. van Wijk, "Squarified Treemaps", Proceedings of the joint Eurographics and IEEE TVCG Symposium on Visualization, 2000, Springer, pp 33-42.


reference:
F.Vernier and L. Nigay, "Modifiable Treemaps Containing Variable Shaped Units", IEEE Information Visualization 2000 Extended Abstracts, available from http //iihm.imag.fr/publs/2000/Visu2K_Vernier.pdf.


reference:
Human Computer Interaction Lab, "Treemap 3.2", available from http //www.cs.umd.edu/hcil/treemap3.


reference:
Technische Universiteit Eindhoven, "SequoiaView", available from http //www.win.tue.nl/sequoiaview.


reference:
Chalmers, M. & Chitson, P. (1992) "Bead Explorations in Information Visualization". In Proceedings of SIGIR '92, 330-337.


reference:
Fox, E.A., France, R.K., Sahle, E., Daoud, A. & Cline, B.E. (1993) "Development of a Modern OPAC From REVTOLC to MARIAN". In Proceedings of SIGIR '93, Pittsburgh, pp. 248-259.


reference:
Ahlberg, C. & Shneiderman, B. (1994) "Visual Information Seeking Tight Coupling of Dynamic Query Filters with Starfield Displays". In Proceedings of CHI '94, Boston. ACM Press, 313-317, 479-480.


reference:
Mackinlay, J. (1986) "Automating the Design of Graphical Presentations of Relational Information". Trans. on Graphics, 5(2), 110-141.


reference:
Nowell, L.T., et al. (1996) "Visualizing Search Results Some Alternatives to Query-Document Similarity". In Proc. of SIGIR 96, ACM Press, 67-75.


reference:
Ware, C. (2000) "Information Visualization Perception for Design". New York Morgan Kaufmann.


reference:
Heath, L..S., Hix, D., Nowell, L.T., Wake, W. C., Averboch, G.A., Labow, E., Guyer, S.A., Brueni, D.J., France, R. K., Dalal, K., & Fox, E.A. (1995) "Envision A User- Centered Database of Computer Science Literature". Communications of the ACM, 38(4), 52-53.


reference:
Tufte, E.R. (1990) "Envisioning Information". Cheshire, CT Graphics Press.


reference:
Salton, G.; Wong, A.; & Yang, C. (1975) "A Vector Space Model for Automatic Indexing. CACM", 18(11), 613-620.


reference:
Nowell, L.T. (1997) "Graphical Encoding for Information Visualization Using Icon Color, Shape, and Size to Convey Nominal and Quantitative Data". PhD thesis for Dept. of Computer Science, Virginia Tech, Blacksburg, VA. http //scholar.lib.vt.edu/theses/available/etd-111897-163723/


reference:
Cleveland, W. S. & McGill, R. (1995) "Graphical Perception and Graphical Methods for Analyzing Scientific Data". Science, 229, 828-833.


reference:
Bates, M. (1984) "The Fallacy of the Perfect Thirty-Item On-Line Search". RQ, 42(1), 43-50.


reference:
Cahill, M. & Carter, R. (1976) "Color Code Size for Searching Displays of Different Density". Human Factors, 18(3), 273-280.


reference:
Carswell, C. M. & Wickens, C. D. (1987) "Information Integration and the Object Display an Interaction of Task Demands and Display Superiority". Ergonomics, 30(3) 511-527.


reference:
Christ, R. E. (1984) "Research for Evaluating Visual Display Codes an Emphasis on Colour Coding". In R. Easterby & H. Zwaga (Ed.), Information Design The Design and Evaluation of Signs and Printed Material, New York, NY John Wiley, 209-228.


reference:
Christ, R. E. (1975) "Review and Analysis of Color Coding Research for Visual Displays". Human Factors, 17(6) 542-570.


reference:
Cleveland, W. S. & McGill, R. (1984) "Graphical Perception Theory, Experimentation, and Application to the Development of Graphical Methods". J. Amer. Stat. Assoc., 79(387), 531-554.


reference:
Fox, E.A., Hix, D., Nowell, L.T., Brueni, D., Wake, W.C., Heath, L.S., & Rao, D. "Users, User Interfaces, and Objects Envision, a Digital Library". JASIS, 44(5), 480-491.


reference:
Jubis, R.M.T. (1990) "Coding Effects on Performance in a Process Control Task with Uniparameter and Multiparameter Displays". Human Factors, 32(3) 287-297.


reference:
Kopala, C. J. (1979) "The Use of Color-Coded Symbols in a Highly Dense Situation Display". In Proceedings HFS, 397-401.


reference:
Luder, C.B. & Barber, P.J. (1984) "Redundant Color Coding on Airborne CRT Displays". In Human Factors, 26, 19-32.


reference:
Merwin, D.H. & Wickens, C.D. (1993) "Comparison of Eight Color and Gray Scales for Displaying Continuous Data". In Proc. HFS, v. 2, 1330-1334.


reference:
Nowell, L. T. & Hix, D. (1993) "Visualizing Search Results User Interface Development for the Project Envision Database of Computer Science Literature". In Proc. HCI Int'l '93, 56-61.


reference:
Schulman, Robert S. (1992) "Statistics in Plain English with Computer Applications". New York Chapman and Hall.


reference:
Smallman, H.S. & Boynton, R.M. (1990) "Segregation of Basic Colors in an Information Display". J. Optical Soc. America, 7(102), 1985-1994.


reference:
Smith, L. & Thomas, D. (1964) "Color Versus Shape Coding in Information Displays". J. Applied Psych., 48(3), 137-146.


reference:
Umbers, I.G. & Collier, G.D. (1990) "Coding Techniques for Process Plant VDU Formats". Applied Ergonomics, 21(3), 187-198.


reference:
Walker, P. (ed.) (1988) "Chambers Science and Technology Dictionary", New York Chambers/Cambridge.


reference:
Wickens, C. & Andre, A. (1990) "Proximity Compatibility and Information Display Effects of Color, Space, and Objectness on Information Integration". Human Factors, 32(1), 61-77.


reference:
Wickens, C. (1992) "Engineering Psychology and Human Performance", 2nd. Ed. New York, NY Harper Collins.


reference:
Fairchild, K.M., Poltrock, S.E., & Furnas, G.W. (1988) "SemNet Three-Dimensional Graphic Representations of Large Knowledge Bases". In Guindon, R. (Ed.), Cognitive Science and Its Application for Human-Computer Interaction, Hillsdale, NJ Lawrence Erlbaum,, 201-233.


reference:
Noik, E. (1993) "Exploring large hyperdocuments fisheye views of nested networks", Proceedings of the fifth ACM conference on Hypertext, 192-205.


reference:
Lamping, J., Rao, R., Pirolli; P. (1995) "A focus+context technique based on hyperbolic geometry for visualizing large hierarchies" Conference proceedings on Human factors in computing systems, 1995, 401-408.


reference:
Beaudoin, L. , Parent, M-A, Vroomen, L. (1996) "Cheops a compact explorer for complex hierarchies", Symposium on Volume Visualization - Proc. of the conference on Visualization '96, 87-92 + color p. 471, ACM, New York.


reference:
Hightower, R. R., Ring, L., Helfman, J., Bederson, B. B., & Hollan, J. D. (1998). "Graphical Multiscale Web Histories A Study of PadPrints". In Proceedings of ACM Conference on Hypertext (Hypertext 98) ACM Press, 58-65.


reference:
Jul, S., & Furnas, G. W. (1998). "Critical Zones in Desert Fog Aids to Multiscale Navigation". In Proceedings of User Interface and Software Technology UIST 98, 97-106, ACM.


reference:
Card, S. K., MacKinlay, J. D., Shneiderman, B., (1999) "Readings in Information Visualization Using Vision to Think", Morgan Kaufmann Publishers.


reference:
Bederson, B. B., Meyer, J., & Good, L. (2000). "Jazz An Extensible Zoomable User Interface Graphics Toolkit in Java". UIST 2000, ACM Symposium on User Interface Software and Technology, CHI Letters, 2(2), 171-180.


reference:
Bederson, B., Shneiderman, B., Wattenberg, M. (2002). "Ordered and Quantum Treemaps Making Effective Use of 2D Space to Display Hierarchies", To appear in ACM Transactions on Computer Graphics.


reference:
Shneiderman, B. (1994). "Dynamic queries for visual information seeking". IEEE Software, 11, (6), 70-77.


reference:
Walker II., J. Q. (1990) "A node-positioning algorithm for general trees". Softw. Pract. Exp., 20(7) 685-705.


reference:
Herman, I., Delest, M., Melançon, G (1998) "Tree Visualisation and Navigation Clues for Information Visualisation" Computer Graphics Forum, 17(2), 153-165.


reference:
Ellson, J., Gansner, E., Koutsofios, E., Mocenigo, J., North, S. , Woodhull, G., "Graphviz, open source graph drawing software", http //www.research.att.com/sw/tools/graphviz/


reference:
Kumar, H.P., Plaisant, C., Shneiderman, B. (1997) "Browsing hierarchical data with multi-level dynamic queries and pruning" International Journal of Human-Computer Studies, Volume 46, No. 1, 103-124.


reference:
Chignell, M, Poblete F., Zuberec, S. (1993) "Exploration in the Design Space of Three-Dimensional Hierarchies" Proceedings of the Human Factors and Ergonomics Society 37th Annual Meeting, v.1, 333-337.


reference:
Hopkins, D. (1989), "The Shape of PSIBER Space PostScript Interactive Bug Eradication Routines". Proc. 1989 Usenix Graphics Conference, Monterey California. www.catalog.com/hopkins/psiber/psiber.html


reference:
Card, S., Nation, D., "Degree-of-Interest Trees a component of attention-reactive user interface". Proc. of Advanced Visual Interface '02, May 22-24, 2002., ACM.


reference:
Mullet, K., Fry, C., Schiano, D. (1997) "On your marks, get set, browse! (the great CHI'97 Browse Off)", Panel description in ACM CHI'97 extended abstracts, ACM, New York, 113-114.


reference:
Beard, D. V., Walker II, J. Q. (1990). "Navigational Techniques to Improve the Display of Large Two-Dimensional Spaces". Behavior & Information Technology. 9 (6), 451-466.


reference:
Bertin, J. (1983) "Semiology of Graphics, Diagrams, Networks, Maps", University of Wisconsin Press, Madison, WI.


reference:
Nation, D.A., Plaisant, C., Marchionini, G., Komlodi, A. (1997) "Visualizing websites using a hierarchical table of contents browser WebTOC", Proc. of 3rd Conference on Human Factors and the Web, 1997, Denver, CO, June 12.


reference:
Furnas, G. (1981) "The FISHEYE view a new look at structured file", 1981 Bell Lab. Tech. Report.


reference:
Andrews, K., Heidegger, H. (1998) "Information Slices Visualising and exploring large hierarchies using cascading, semicircular disks". Proc of IEEE Infovis '98 late breaking Hot Topics IEEE, 9-11. ftp //ftp.iicm.edu/pub/papers/ivis98.pdf


reference:
Robertson, G., Czewinski, M., Larson, K., Robbins, D., Thiel, D., & van Dantzich, M., (1998) "Data Mountain Using spatial memory for document management". In Proceedings of UIST'98, San Fransisco, CA, November 1998, ACM Press, 153-162.


reference:
Tavanti,M. & Lind M., (2001) "2D vs. 3D, Implications on Spatial Memory", In Andrews, K., Roth, S. & Wong, P. C. (eds) (2001) Proceedings of 2001 Information Visualization, San Diego, CA, October 2001, IEEE Computer Society, 139-145.


reference:
Simons, D. (2000) "Current Approaches to Change Blindness", In Simons, D. (ed) (2000) Visual Cognition Special Issue - Change Blindness and Visual Memory, 7.


reference:
Baird, J.C. & Biersdorf, W.R. (1967). "Quantitative functions for size and distance judgments". Perception & Psychophysics, 2, 161-166.


reference:
Gilinsky, A. (1951). "Perceived size and distance in visual space". Psychological Review, 58, 460-482.


reference:
Gogel, W. C. (1977). "The metric of visual space". In W. Epstein (Ed.), Stability and Constancy in Visual Perception. New York Wiley.


reference:
Howes, A., Miles, G.E., Payne, S.J., Mitchell, C.D., & Davies, A.J. (2001). "Incidental memory and navigation in panoramic virtual reality for electronic commerce". Human Factors, 43 2, 239-254.


reference:
Pizlo, Z. (1994). "A theory of shape constancy based on perspective invariants". Vision Research, 34(12), 1637-58.


reference:
Tittle, J. S., Todd, J. T., Perotti, V. J., & Norman, J. F. (1995). "Systematic distortion of perceived three-dimensional structure from motion and binocular stereopsis". Journal of Experimental Psychology Human Perception and Performance, 21(3), 663-678.


reference:
Todd, J.T. & Bressan, P. (1990). "The perception of 3-dimensional affine structure fromminimal apparent motion sequences". Perception & Psychophysics, 48, 419-430.


reference:
Todd, J. T., Tittle, J. S., & Norman, J. F. (1995). "Distortions of three-dimensional space in the perceptual analysis of motion and stereo". Perception, 24, 75-86.


reference:
Toye, R.C. (1986). "The effect of viewing position on the perceived layout of space". Perception & Psychophysics , 40, 85-92.


reference:
T. J. Davis and C. P. Keller. "Modelling and visualizing multiple spatial uncertainties". Computers and Geosciences, 23(4) 397-408, 1997.


reference:
F. J. M. van der Wel, L. C. van der Gaag, and B. G. H. Gorte. "Visual exploration of uncertainty in remote-sensing classification". Computers and Geosciences, 24(4) 335-343, 1998.


reference:
E. R. Tufte. "The Visual Display of Quantitative Information", Second Edition. Graphics Press, 2001.


reference:
A. Cedilnik and P. Rheingans. "Procedural annotation of uncertain information". In Proceedings of the IEEE Visualization Conference, pages 77-84, Salt Lake City, Utah, October 2000.


reference:
W. S. Cleveland. "The Elements of Graphing Data". Wadsworth, 1985.


reference:
Y. Fua, M. O. Ward, and E. A. Rundensteiner. "Navigating hierarchies with structurebased brushes". In Proceedings of the IEEE Symposium on Information Visualization, pages 58-64, San Francisco, California, October 1999.


reference:
C. Olston and J. Mackinlay. "Visualizing data with bounded uncertainty". Technical report, Stanford University Computer Science Department, 2002. http //dbpubs.stanford.edu/pub/2002-20.


reference:
J. M. Hellerstein, R. Avnur, A. Chou, C. Hidber, C. Olston, V. Raman, T. Roth, and P. Haas. "Interactive data analysis with CONTROL". IEEE Computer, August 1999.


reference:
R. L. Harris. "Information Graphics". Oxford University Press, 1999.


reference:
A. M. MacEachren. "Visualizing uncertain information". Cartographic Perspective, (13) 10-19, 1992.


reference:
C. Olston and J. Widom. "Approximate caching for continuous queries over distributed data sources". Technical report, Stanford University Computer Science Department, 2002. http //dbpubs.stanford.edu/pub/2002-8.


reference:
A. T. Pang, C. M. Wittenbrink, and S. K. Lodha. "Approaches to uncertainty visualization". The Visual Computer, pages 370-390, November 1997.


reference:
R. Twiddy, J. Cavallo, and S. M. Shiri. "Restorer A visualization technique for handling missing data". In Proceedings of the IEEE Visualization Conference, pages 212-216, Washington, D.C., October 1994.


reference:
B. N. Taylor and C. E. Kuyatt. "Guidelines for evaluating and expressing the uncertainty of nist measurement results". Technical report, National Institute of Standards and Technology Note 1297, Gaithersburg, Maryland, 1994.


reference:
A. Woodruff and C. Olston. "Iconification and omission in information exploration". In SIGCHI '98 Workshop on Innovation and Evaluation in Information Exploration Interfaces, Los Angeles, CA, April 1998. http //www.fxpal.com/ConferencesWorkshops/CHI98IE/submissions/woodruff.htm.


reference:
C. M. Wittenbrink, E. Saxon, J. J. Furman, A. T. Pang, and S. K. Lodha. "Glyphs for visualizing uncertainty in environmental vector fields". IEEE Transactions on Visualization and Computer Graphics, pages 266-279, September 1996.


reference:
J.W. Tukey. "Exploratory Data Analysis". Addison Wesley, 1977.


reference:
D. A. Keim and A. Herrmann. "The gridfit algorithm An efficient and effective approach to visualizing large amounts of spatial data". IEEE Visualization, Research Triangle Park, NC, pages 181-188, 1998.


reference:
C. J. Kocmoud and D. H. House. "Continuous cartogram construction". Proceedings IEEE Visualization, pages 197-204, 1998.


reference:
K. Mehlhorn and S. Näher. "The LEDA Platform of Combinatorial and Geometric Computing". Cambridge University Press, 1st edition, 1999. http //www.mpi-sb.mpg.de/~mehlhorn/LEDAbook.html.


reference:
D. A. Keim, S. C. North, and C. Panse. "Cartodraw A fast algorithm for generating contiguous cartograms". Information Visualization Reseach Group, AT&T Laboratories, Florham Park, 2002.


reference:
H. Central. "A history of presidential elections", www.multied.com/elections. Mar. 2002.


reference:
H. Edelsbrunner and R. Waupotitsch. "A combinatorial approach to cartograms. Computational Geometry", pages 343-360, 1997.


reference:
W. Tobler. "Cartograms and cartosplines". Proceedings of the 1976 Workshop on Automated Cartography and Epidemiology, pages 53-58, 1976.


reference:
S. Venkatasubramanian. "Computing integer cartograms is NP-complete". Technical Report, ATT Research Labs, 2002.


reference:
Eades, P. and Tamassia R. Algorithms for drawing graphs: An annotated bibliography. Tech. Rep. CS-89-90, Dept.. of COMPUTER Science, Brown University providence, R.I., 1989.


reference:
Fairchild, K.M, Poltrok, S,E,., ,and Furnas G.W.semnet: Three-dimension nal graphic representation of large knowledge bases. In Cognitive Science and Its Applications for Human Computer INTERACTION. Lawrence Erlbaum Assoc. 1988, pp. 201-233.


reference:
Farrand, W.A. lnformation dislplay in interactive design. Ph.D. dissertation,. Dept. of Engineering, Univ. of California, Los Angeles, 1973.


reference:
Johnson, g., Schtneiderman. B. Space.-. filling approach to the visualization of hierarchical information Structures. In Proceedings of IEEE Visualization '91 (1991), pp 284-291.


reference:
Kaugars, K., and Brazma, A. CATGraph: Visualizing .large labeled graphs. "Tech. Rep. 92-CS-08, Computer Science Dept., New Mexico State Univ. April, 1992.


reference:
Schaffer et al. Comparing fisheye and full zoom techniques for navigation of hierarchically clustered networks. In Proceedings of Graphics Interface (1993).


reference:
Spence, R..and Apperley, M. Database navigation: An office enviromnent for the professional. Behavior and Information Technology, 1 1 (1982), pp, 43-54.


reference:
John Domingue , Blaine Price , Marc Eisenstadt, A framework for describing and implementing software visualization systems, Proceedings of the conference on Graphics interface '92, p.53-60, September 1992, Vancouver, British Columbia, Canada


reference:
Marc H. Brown , Marc A. Najork, Algorithm animation using 3D interactive graphics, Proceedings of the 6th annual ACM symposium on User interface software and technology, p.93-100, December 1993, Atlanta, Georgia, United States


reference:
Ayellet Tal , David Dobkin, GASP: a system to facilitate animating geometric algorithms, Proceedings of the tenth annual symposium on Computational geometry, p.388-389, June 06-08, 1994, Stony Brook, New York, United States


reference:
Kurt Mehlhorn , Stefan Näher, LEDA: a platform for combinatorial and geometric computing, Communications of the ACM, v.38 n.1, p.96-102, Jan. 1995


reference:
Marc Brown , John Domingue , Blaine Price , John Stasko, Software visualization, Conference companion on Human factors in computing systems, p.463, April 24-28, 1994, Boston, Massachusetts, United States


reference:
Andries van Dam, The electronic classroom: workstations for teaching, International Journal of Man-Machine Studies, v.21 n.4, p.353-363, Oct. 1984


reference:
Jim Gray , Andreas Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1992


reference:
Ayellet Tal , David Dobkin, Visualization of Geometric Algorithms, IEEE Transactions on Visualization and Computer Graphics, v.1 n.2, p.194-204, June 1995


reference:
Marc H. Brown , John Hershberger, Color and Sound in Algorithm Animation, Computer, v.25 n.12, p.52-63, December 1992


reference:
Steven P. Reiss, Program Visualization: Where We Go From Here, Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1, p.218-227, September 07-11, 1992


reference:
Giuseppe Di Battista , William Lenhart , Giuseppe Liotta, Proximity Drawability: a Survey, Proceedings of the DIMACS International Workshop on Graph Drawing, p.328-339, October 10-12, 1994


reference:
Prosenjit Bose , Giuseppe Di Battista , William Lenhart , Giuseppe Liotta, Proximity Constraints and Representable Trees, Proceedings of the DIMACS International Workshop on Graph Drawing, p.340-351, October 10-12, 1994


reference:
James E. Baker , Isabel F. Cruz , Giuseppe Liotta , Roberto Tamassia, The Mocha algorithm animation system, Proceedings of the workshop on Advanced visual interfaces, May 27-29, 1996, Gubbio, Italy


reference:
P. Bose, W. Lenhart, and G. Liotta. Characterizing proximity trees. Algorithmica. (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia, to appear).


reference:
M. H. Brown. Algorithm Animation. MIT Press, Cambridge, 1988.


reference:
M. H. Brown. ZEUS: A System for Algorithm Animation and Multi-View Editing. In IEEE Symposium on Visual Languages (VL '91), pages 4--9, 1992. Also available from http://gatekeeper.dec.com/pub/DEC/SRC/research-reports/abstracts/src-rr-075.html.


reference:
M. H. Brown and R. Sedgewick. Techniques for algorithm animation. IEEE Software, 2(1):28--39, 1985.


reference:
K. R. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18:259--278, 1969.


reference:
E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns. Addison Wesley, 1995.


reference:
S. C. Glassman. A Turbo Environment for Producing Algorithm Animation. In IEEE Symposium on Visual Languages (VL '93), pages 32--36, 1993.


reference:
J. Gosling and H. McGilton. The Java language environment: a white paper, 1995. http://www.javasoft.com/whitePaper/java-whitepaper-1.html.


reference:
J. W. Jaromczyk and G. T. Toussaint. Relative neighborhood graphs and their relatives. Proc. IEEE, 80(9):1502--1517, Sept. 1992.


reference:
D. G. Kirkpatrick and J. D. Radke. A framework for computational morphology. In G. T. Toussaint, editor, Computational Geometry, pages 217--248. North-Holland, 1985.


reference:
F. Manola. MetaObject protocol concepts for a RISC object model. Technical Report 0244-12-93-165, GTE Laboratories, Inc., December 1993.


reference:
J. Muthukumarasamy and J. T. Stasko. Visualizing Program Executions on Large Data Sets Using Semantic Zooming. Technical Report GIT-GVU-95-02, Georgia Institute of Technology, 1995.


reference:
B. Myers. Taxonomies of visual programming and program visualization. J. of Visual Languages and Computating, 1(1):97--123, March 1990.


reference:
S. P. Reiss. A Framework for Abstract 3D Visualizations. In IEEE Symposium on Visual Languages (VL '93), pages 100--107, 1993.


reference:
S. P. Reiss and I. F. Cruz. Practical Software Visualization. In CHI '94 Workshop on Software Visualization, 1994.


reference:
J. T. Stasko. The path-transition paradigm: a practical methodology for adding animation to program interfaces. J. of Visual Languages and Computing, 1(3):213--236, 1990.


reference:
J. T. Stasko. Simplifying algorithm animation with tango. In Proc. IEEE Workshop on Visual Languages, pages 1--6, 1990.


reference:
G. T. Toussaint. The relative neighbourhood graph of a finite planar set. Pattern Recogn., 12:261--268, 1980.


reference:
Michael Stonebraker , Greg Kemnitz, The POSTGRES next generation database management system, Communications of the ACM, v.34 n.10, p.78-92, Oct. 1991


reference:
Wilbert O. Galitz, User-interface screen design, John Wiley andamp; Sons, Inc., New York, NY, 1992


reference:
Alexander Aiken , Jolly Chen , Michael Stonebraker , Allison Woodruff, Tioga-2: A Direct Manipulation Database Visualization Environment, Proceedings of the Twelfth International Conference on Data Engineering, p.208-217, February 26-March 01, 1996


reference:
Allison Woodruff , Michael Stonebraker, Visual Information Density Adjuster (VIDA), University of California at Berkeley, Berkeley, CA, 1997


reference:
Allison Woodruff , James Landay , Michael Stonebraker, End-user Interaction with Clutter Reduction Techniques, University of California at Berkeley, Berkeley, CA, 2000


reference:
Yannis Ioannidis , Miron Livny , Jian Bao , Eben M. Haber, User-oriented visual layout at multiple granularities, Proceedings of the workshop on Advanced visual interfaces, May 27-29, 1996, Gubbio, Italy


reference:
Buttenfield, B. P. and McMaster, R. B. (eds.), Map Generalization: Making Rules for Knowledge Representation, Longman, London, 1991.


reference:
Frank, A., and Timpf, S., "Multiple Representations for Cartographic Objects in a Multi-scale Tree - An Intelligent Graphical Zoom," Computers andamp; Graphics, Nov.-Dec. 1994, 18(6):823--829.


reference:
Furnas, G. W., "The FISHEYE View: A New Look at Structured Files," Bell Laboratories Tech. Report, Murray Hill, New Jersey, 1981.


reference:
Nickerson, J. V., Visual Programming. Ph.D. Dissertation. New York Univ., New York, 1994.


reference:
Olston, C. and Stonebraker, M., "VIQING: Visual Interactive QueryING," submitted for publication, Sept. 1997.


reference:
Phillips, R. J. and Noyes, L., "An Investigation of Visual Clutter in the Topographic Base of a Geological Map," Cartographic J., Dec. 1982, 19(2):122--131.


reference:
Springer, C., "Retrieval of Information from Complex Alphanumeric Displays: Screen Formatting Variables' Effects on Target Identification Time," Cognitive Engineering in the Design of Human-Computer Interaction and Expert Sys. (Proc. 2nd Int'l Conf. on Human-Computer Interaction, Honolulu, Hawaii, Aug. 1987, Vol. II), pp. 375--382, G. Salvendy (ed.), Elsevier, Amsterdam, 1987.


reference:
Töpfer, F., and Pillewizer, W., "The Principles of Selection, A Means of Cartographic Generalization," Cartographic J., 1966, 3(1):10--16.


reference:
Tullis, T. S., "Screen Design," Handbook of Human-Computer Interaction, M. Helander (ed.), Elsevier Science Publishers B. V., Amsterdam, 1988.


reference:
Paul E. Haeberli, ConMan: a visual programming language for interactive graphics, ACM SIGGRAPH Computer Graphics, v.22 n.4, p.103-111, Aug. 1988


reference:
Keith Haviland , Ben Salama, UNIX system programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1987


reference:
James L. Helman , Lambertus Hesselink, Representation and Display of Vector Field Topology in Fluid Flow Data Sets, Computer, v.22 n.8, p.27-36, August 1989


reference:
P. Buning et al., "Flow Visualization of CFD Using Graphics Workstations", AIAA 87-1180, Proc. 8th Computational Fluid Dynamics Conf., June 9--11, 1987.


reference:
G. Bancroft, "Scientific Visualization in Computational Aerodynamics at NASA Ames Research Center, IEEE Computer, August 1989


reference:
P. Walatka, P. Buning, PLOT3D Users Manual Version 3.6 NASA TM101067, 1989


reference:
T. Plessel, SURF Users Manual, NASA Ames Research Center, Code RFW, 1988


reference:
T. Plessel, GAS Users Manual, NASA Ames Research Center, Code RFW, 1988


reference:
S. Leffler, et al., "The Design and Implementation of the 4.3 BSD UNIX Operating System", Addison Wesley, 1989


reference:
Stellix Programmers Guide, Chapters 15--17, Stellar Computer Inc., 1988


reference:
D. Tristram, P. Walatka, E. Raible "Panel Library Programmers Manual, Version 95", NASA Ames Report RNR-90-006


reference:
F. White, "Fluid Mechanics", McGraw-Hill 1979


reference:
D. Anderson, "Compuational Fluid Mechanics and Heat Transfer", Mcgraw-Hill 1984


reference:
L. M. Milne, "Theoretical Aerodynamics", Dover Press 1973


reference:
T. Lasinski, "Second Generation Graphics Workstations, Request For Proposals", RFP2-33491, January 1989


reference:
S. Rogers, "Distributed Interactive Graphics Applications in Computational Fluid Dynamics", Interanational Journal of Supercomputing Applications, Vol 1, No. 4, Winter 1987


reference:
E. Hibbard, "ARCGRAPH (Ames Research Center Graphics Metafile) Manual", NASA Ames Research Center


reference:
Jock Mackinlay , Michael R. Genesereth, Expressiveness and language choice, Data andamp; Knowledge Engineering, v.1 n.1, p.17-29, June 1985


reference:
Casner, S. (in press) Building customized diagramming languages. In S.-K. Chang (Ed.) Visual languages and visual programming. New York: Plenum.


reference:
Krantz, D. H., Luce, R. D., Suppes, P. and Tversky, A. (1971) Foundations of Measurement (Vol.1) New York: Academic Press.


reference:
Wehrend, S. (1990) A categorization of scientific visualization techniques. MS Thesis, Department of Computer Science, University of Colorado, Boulder Co.


reference:
E. Anderson (1957), A Semigraphical Method For The Analysis of Complex Problems, Proc. Nat. Acad, Sci. USA 13 923--927,


reference:
D. F. Andrews (1972), Plots of High-Dimensional Data, Biometrics, 29:125--136,


reference:
T. F. Banchoff, C. M. Strauss (1979), Real Time Computer Graphics Analysis of Figures in Four-Space, in [8],


reference:
V. Barnett Edit. (1981), Interpreting Multivariate Data, Wiley, New York,


reference:
M. Bolorfoush and E. J. Wegman (1988) On Some Graphical Representations of Multivariate Data, in Proc. of Interface '88, Amer. Stat. Assoc., Alexandria, Virginia,


reference:
V. G. Boltyanskii (1964), Envelopes, Translated from the Russian by R. B. Brown, Pergamon Press, New York,


reference:
D. Brissom Edit. (1979), Hypergraphics: Visualizing Complex Relationships in Art, Science and Technology, Amer. Assoc. for the Advanc. of Scienc., Westview Press, Boulder,


reference:
O. S. Brodetsky (1920), A First Course in Nomography G. Bell andamp; Sons, London 1949 (First published 1920),


reference:
J. M. Chambers, W. S. Cleveland, B. Kleiner andamp; P. A. Tukey (1983) Graphical Methods for Data Analysis Duxbury Press, Boston,


reference:
Y. Chen, M. Hsieh, A. Inselberg, H. Lee Constrained Planar Conflict Resolution for Air Traffic Control in preparation,


reference:
H. Chernoff (1973), The Use of Faces to Represent Points in k-Dimensional Space Graphically, J. Amer. Stat. Assoc. 68:361--368,


reference:
T. Chomut (1987), Exploratory Data Analysis Using Parallel Coordinates M. Sc. Thesis, UCLA Dept. of Comp. Sc., IBM LA Sc. Cen. Rep., 1987--2811,


reference:
S. M. Cohan, D. C. H. Yang (1986), Mobility Analysis of Planar Four-Bar Mechanisms through the Parallel Coordinate System, J. of Mech. andamp; Mach. Th. 21: 63--71.


reference:
H. S. M. Coxeter (1974), Projective Geometry, Univ. of Toronto Press, Toronto,


reference:
A. Desai, L. C. Walters (1988), Graphical Presentations of Data Envelopment Analyses: Management Implications from Parallel Axes Representations, sub. for pub.,


reference:
B. Dimsdale (1981), Operating Point Selection for Multivariate Systems, IBM LA Sc. Cen. Rep., #ZZ20--6249,


reference:
P. Ehrenfest (1917), In What Way Does it Become Manifest in the Fundamental Laws of Physics that Space has 3 Dimensions? Collected Scientific Papers, M. J. Klein, Edit., Interscience, NY, 1959,


reference:
J. S. Eickemeyer (1989) Visualizing p-Flats in N-Space Using Parallel Coordinates, in preparation,


reference:
P. Fiorini, A. Inselberg (1988), Parallel Coordinates a new Representation for Robotics to appear in Proc. of NATO Adv. Res. Workshop, Salon, Italy, Springer-Verlag,


reference:
P. Fiorini, A. Inselberg (1989), Configuration Space Representation in Parallel Coordinates in Proc. of 1989 IEEE Inter. Conf. on Robotics and Automation, IEEE Computer Society, pp 1215--1220,


reference:
B. Flury, H. Riedwyl (1981) Graphical Representation of Multivariate Data by Means of Asymmetrical Faces J. Amer. Stat. Assoc. 76:757--765,


reference:
J. Friedman and J. Tukey (1974), A Projection Pursuit Algorithmfor Exploratory Data Analysis, IEEE Trans. Comp., C-23:881--890,


reference:
C. Gennings, K. L. Dawson, W. H. Carter Jr., R. H. Myers (1988) Interpreting Plots of a Multi-Dimensional Dose-Response Surface in a Parallel Coordinate System, sub. for pub.,


reference:
J. J. Helly (1987), Application of Parallel Coordinates to Complex System Design and Operation, in Proc. of SCGA 1987, Fairfax, VA vol III 541--546,


reference:
H. Hinterberger (1987) Data Density: A Powerful Abstraction to Manage and Analyze Multivariate Data Ph. D. Thesis, Informatik-Dissertation # 4 ETH, Zurich,


reference:
P. J. Huber (1985), Projection Pursuit Ann. Statit. 13:435--475,


reference:
A. Inselberg (1981), N-Dimensional Graphics Part I: Lines andamp; Hyperplanes, IBM LA Sci. Cen. Rep. # G320--2711,


reference:
A. Inselberg (1985), The Plane with Parallel Coordinates, Special Issue on Computational Geometry of The Visual Computer 1: 69--97,


reference:
A. Inselberg, M. Boz, B. Dimsdale (1990), Conflict Resolution, One-Shot Problem and Air Traffic Control, in preparation,


reference:
A. Inselberg, B. Dimsdale (1986), Intelligent Process Control with Integrated Instrumentation in Integrated andamp; Intelligent Manufacturing, C. R. Liu and T. C. Chang Edit., ASME, New York, 341--357,


reference:
A. Inselberg, B. Dimsdale (1988), Multi-Dimensional Lines I: Representations, sub. for pub.,


reference:
A. Inselberg, B. Dimsdale (1987), Multi-Dimensional Lines II :Distance andamp; Proximity, sub. for pub.,


reference:
B. Kleiner, J. A. Hartigan (1981), Representing Points in Many Dimensions by Trees and Castles J. Amer. Stat. Assoc. 76: 260--269,


reference:
R. O. Lejeune (1985), Government-Provided Complex Scenarios for the Advanced Automated System Design Competition Phase MTR-85W240, MITRE Co, McLean, Virginia,


reference:
R. J. Littlefield, W. L. Nicholson (1982), Use of Color and Motion for the Display of Multi-Dimensional Data, Pacific Northwest Laboratory Tech. Rep. # PNL-SA-10897 also Dept. of Energy Rep. # DE83 003596,


reference:
J. Rivero (1989) Phase-Space in Parallel Coordinates, in preparation,


reference:
S. J. Schwager (1986), Applying Statistical Graphics to Multivariate Data Proc. NCGA '86 Anaheim, CA 704--712,


reference:
J. L. Synge and A. Schild (1949) Tensor Calculus, Univ. of Toronto Press, Toronto, p.189,


reference:
D. W. Scott (1986), Data Analysis in 3 and 4 Dimensions With Nonparametric Density Estimation, in Statistical Image Processing and Graphics, E. J. Wegman and D. DePriest, Eds., Marcel Dekker, New York, 291--305,


reference:
J. W. Tukey, P. A. Tukey (1980), Graphical Display for Data sets in 3 or more Dimensions in [8],


reference:
F. W. Young, D. P. Kent andamp; W. F. Kuhfeld (1986), VISUALS: Dynamic Hyper-Dimensional Graphics Software for Visual Exploratory Data Analysis Presented at NCGA '86 Anaheim, CA,


reference:
C. M. Wang, H. W. Gugel (1986) High Perfomance Graphics for Multivariate Data, GM Labs, Tech. Rep. # GMR-5387, Warren, Michigan,


reference:
E. Wegman (1986), Hyperdimensional Data Analysis Using Parallel Coordinates, Cen. Comp. Stat. andamp; Prob. Rep. #1, George Mason Univ., Fairfax, VA,


reference:
William H. Press , Brian P. Flannery , Saul A. Teukolsky , William T. Vetterling, Numerical recipes in C: the art of scientific computing, Cambridge University Press, New York, NY, 1988


reference:
J. L. Helman , Lambertus Hesselink, Surface representations of two- and three-dimensional fluid flow topology, Proceedings of the 1st conference on Visualization '90, October 23-26, 1990, San Francisco, California


reference:
Gordon V. Bancroft , Fergus J. Merritt , Todd C. Plessel , Paul G. Kelaita , R. Kevin McCabe , Al Globus, FAST: a multi-processed environment for visualization of computational fluid dynamics, Proceedings of the 1st conference on Visualization '90, October 23-26, 1990, San Francisco, California


reference:
C. Levit and S. Bryson, "A Virtual Environment for Exploration of Three Dimensional Flowfields," SPIE paper 1457-19 SPIE Conf on Stereoscopic Displays and Applications II. San Jose (1991).


reference:
J. P. M. Hultquist, "Interactive Numerical Flow Visualization Using Stream Surfaces," Computing Systems in Engineering1 (2--4) pp. 349--353.


reference:
H. Poincare, Sur les courbes defines par une equation differentielle. J. Math. 1, 167--244 (1875); 2, 151--217 (1876); 7, 375--422 (188); 8, 251--296 (1882); "Les Methodes nouvelles de la mecanique celeste" Vol 1. Gauthier-Villars, Paris, 1892; Paris, 1928. "OEuvres," Vol. 1 Gauthier-Villars.


reference:
A. A. Andronov, E. A. Leontovich, I. I. Gordon, and A. G. Maier, "Qualitative Theory of Second-Order Dynamic Systems," Translated from Russian by D. Louvish, Halsted Press, John Wiley and Sons, New York, Toronto; Israel Program for Scientific Translations, Jerusalem, London.


reference:
A. A. Andronov, E. A. Leontovich, I. I. Gordon, and A. G. Maier, "Theory of Bifurcations of Dynamic Systems on a Plane (Teoriya bifurkatsii dinamicheskikh sistem na ploskosti)," Izdatel'stovo "Nauka", Glavnaya Redaktsiya, Fizido-Matematicheskoi Literatury, Moskva (1967). Translated from Russian Israel Program for Scientific Translations, Jerusalem (1971).


reference:
J. Guckenheimer and P. Holmes. Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields, Springer Verlag (1983).


reference:
M. Braun, Differential Equations and Their Applications, Springer-Verlag, New York (1978).


reference:
M. Hirsch and S. Smale, Differential Equations, Dynamical Systems and Linear Algebra, Academic Press, New York (1974).


reference:
V. I. Arnold, Ordinary Differential Equations, MIT Press, (1973).


reference:
R. H. Abraham and C. D. Shaw, Dynamics: The Geometry of Behavior, parts 1-4, Ariel Press, Santa Cruz, CA. (1984).


reference:
M. J. Lighthill, "Attachment and Separation in Three Dimensional Flow," Laminar Boundary Layers II, ed. L. Rosenhead, pp. 72--82, Oxford University Press (1963).


reference:
A. E. Perry and B. D. Fairly, "Critical Points in Flow Patterns," Advances in Geophysics 18 B pp. 299--315 (1974).


reference:
M. S. Chong. A. E. Perry, B. J. Cantwell, "A General Classification of Three-Dimensional Flow Fields," Phys. Fluids A 2 (5) pp. 765--777, May (1980).


reference:
A. E. Perry, "A Study of Degenerate and Non-degenerate Critical Points in Three-dimensional Flow Fields," Deutsche Forschungs- und Versuchsanstalt fur Luft und Raumsfahrt report DFVLR-FB 84-36.


reference:
U. Dallman and G. Schewe, "On the Topological Changes of Separating Flow Structures at Transition Reynold Numbers," American Institute of Aeronautics and Astronautics, paper AIAA-87-1266.


reference:
U. Dallman, "Three-dimensional Vortex Structures and Vorticity Topology," Fluid Dynamics Research3 pp. 183--189 (1988).


reference:
A. E. Perry and J. H. Watmuff, "The Phase-Averaged Large-Scale Structures in Three-Dimensional Turbulent Wakes," J. Fluid Mech. 103 pp. 33--51. A. E. Perry and D. K. Tan, "Simple Three-Dimensional Vortex Motions in Coflowing Jets and Wakes," J. Fluid Mech. 141 pp. 197--231, (1984).


reference:
S. Shirayama and K. Kuwahara, "Flow Past a Sphere: Topological Transitions of the Vorticity Field," American Institute of Aeronautics and Astronautics, paper AIAA-90-3105-CP.


reference:
L. Hesselink and J. Helman, "Evaluation of Flow Topology from Numerical Data," American Institute of Aeronautics and Astronautics, paper AIAA-87-1181.


reference:
J. L. Helman and L. Hesselink, "Analysis and Representation of Complex Structures in Separated Flows," SPIE Conf on Extracting Meaning >From Complex Data, San Jose, (1991).


reference:
J. L. Helman and L. Hesselink, "Representation and Display of Vector Field Topology in Fluid Flow Data Sets," IEEE Computer, pp. 27--36, Aug. 1989. Also appears in Visualization in Scientific Computing, G. M. Fielson andamp; B. Shriver, eds. Companion videotape available from IEEE Computer Society Press.


reference:
A. Globus, "Octree Optimization," SPIE paper 1459-01, SPIE Conf on Extracting Meaning From Complex Data, San Jose (1991).


reference:
Mike Yamasaki, NASA Ames Research Center, personal communication.


reference:
P. P. Walatka, P. G. Buning, PLOT3D User's Manual, NASA Technical Memorandum 101067, NASA Ames Research Center.


reference:
J. A. Benek, P. G. Buning, J. L. Steger, "A 3-D Chimera Grid Embedding Technique," AIAA 7th Computational Fluid Dynamics Conference, Cincinnati, Ohio (1985), AIAA-85-1523.


reference:
R. A. Walker, "Computing the Jordan Form for Control of Dynamic Systems," Guidance and Control Laboratory, Department of Aeronautics and Astronautics, Stanford University (1981).


reference:
C. H. Hung, P. G. Buning, "Simulation of Blunt-Fin-Induced Shock-Wave and Turbulent Boundary-Layer Interaction," J. Fluid Mech. (1985), Col. 154, pp. 163--185.


reference:
Y. M. Rizk, S. Ben-Shmuel, "Computation of the Viscous Flow Around the Shuttle Orbiter at Low Supersonic Speeds," AIAA 23rd Aerospace Sciences Meeting, Jan. 14--17, (1985) Reno, Nevada, AIAA-85-0168.


reference:
S. Rogers, D. Kwak, an U. Kaul, "A Numerical Study of Three-Dimensional Incompressible Flow Around Multiple Posts," American Institute of Aeronautics and Astronautics, paper AIAA-86-0353.


reference:
P. G. Buning, I. T. Chiu, S. Obayashi, Y. M. Rizk, and J. L. Steger, "Numerical Simulation of the Integrated Space Shuttle Vehicle in Ascent," Proc. AIAA Atmospheric Flight Mechanics Conference, American Institute of Aeronautics and Astronautics, Minneapolis (1988).


reference:
S. Ying, L. Schiff and J. L. Steger "A Numerical Study of Three-Dimensional Separated Flow Past a Hemisphere Cylinder" Proc. AIAA 19th Fluid Dynamics, Plasma Dynamics and Lasers Conference.


reference:
L. A. Yates and G. T. Chapman, "Streamlines, Vorticity Lines, and Vortices," American Institute of Aeronautics and Astronautics, paper AIAA-91-0731.


reference:
A. E. Perry and H. Hornung, "Some Aspects of Three-Dimenstional Separation, Part II: Vortex Skeletons," Z. Flugwiss, Weltraumforsch. 8, Heft 3, pp. 155--160 (1984).


reference:
A. Globus, C. Levit, T. Lasinski, "A Tool for Visualizing the Topology of Three-Dimensional Vector Fields," Report RNR-91-017, Applied Research Branch, MS T045-1, NASA Ames Research Center, Moffett Field, CA, 94035.


reference:
Andreas Buja , Daniel Asimov, Grand tour methods: an outline, Proceedings of the Seventeenth Symposium on the interface of computer sciences and statistics on Computer science and statistics, p.63-67, June 1986, Lexington, Kentucky, United States


reference:
John Alan McDonald , Werner Stuetzle , Andreas Buja, Painting multiple views of complex objects, ACM SIGPLAN Notices, v.25 n.10, p.245-257, Oct. 1990


reference:
John B. Adams, Milton O. Smith, and Alan R. Gillespie. Simple models for complex natural surfaces: A strategy for the hyperspectral era of remote sensing. In IGARRS'89, the IEEE International Geoscience and Remote Sensing symposium, 1989.


reference:
David F. Andrews. Plots of high-dimensional data. Biometrics, 28:125--136, 1972.


reference:
Richard Boyer and David Savageau. Places Rated Almanac. Rand MacNally, Chicago, 1985.


reference:
Andreas Buja, Catherine Hurley, and John Alan McDonald, A Data Viewer for multivariate data. In Computer Science and Statistics: Proc. 18th Symp. on the Interface, pages 171--174, Washington, D.C., 1987. ASA.


reference:
Andreas Buja, Catherine Hurley, and John Alan McDonald. Elements of a viewing pipeline for data analysis. In W. S. Cleveland and M. E. McGill, editors, Dynamic Graphics for Statistics. Wadsworth and Brooks/Cole, Belmont, Ca., 1988.


reference:
Andreas Buja, John A. McDonald, John Michalak, Werner Stuetzle, and Steve Willis. Visualization of quantitative data, 1990. A 27 minute video tape; Dept of Statistics, U. of Washington.


reference:
Herman Chernoff. The use of faces to represent points in k-dimensional space graphically. Journal of the American Statistical Association, 68:361--368, 1973.


reference:
Persi Diaconis and Jerome H. Friedman. M and N plots. In Recent Advances in Statistics: Papers in Honor of Herman Chernoff on his Sixtieth Birthday, pages 425--447. Academic Press, New York, 1983.


reference:
Kim M. Fairchild, Stephen E. Poltrock, and George W. Furnas. SemNet: three-dimensional graphic representations of large knowledge bases. In Raymonde Guindon, editor, Cognitive Science and its applications for human-computer interaction, chapter 5, pages 201--233. Lawrence Erlbaum Associates, Hillsdale, NJ, 1988.


reference:
Mary Anne Fisherkeller, Jerome H. Friedman, and John W. Tukey. Prim-9, an interactive multidimensional data display and analysis system. In Proc. of Pacific 75, ACM Regional Conference., 1974.


reference:
Jerome H. Friedman and John W. Tukey. A projection pursuit algorithm for exploratory data analysis. IEEE Trans. Comput., C-23, 1974.


reference:
George W. Furnas. Dimensionality constraints on projection and section views of high dimensional loci. In Computer Science and Statistics: Proc. of the 20 Symp. on the Interface, Washington, D.C., 1988. ASA.


reference:
Catherine Hurley. The Data Viewer: a program for graphical data analysis. PhD thesis, Dept. of Statistics, U. of Washington, 1987.


reference:
Edwin L. Hutchins, James D. Hollan, and Donald A. Norman. Direct manipulation interfaces. In D. A. Norman and S. W. Draper, editors, User Centered System Design: New Perspectives in Human-Computer Interaction. Erlbaum, Hillsdale NJ, 1986.


reference:
A. Inselberg. The plane with parallel coordinates. The Visual Computer, 1:69--91, 1985.


reference:
John Alan McDonald. Exploring data with the Orion I workstation, 1982. A 25 minute, 16mm sound film, which demonstrates programs described in McDonald (1982) It is available for loan from: Jerome H. Friedman, Computation Research Group, Bin # 88, SLAC, P.O. Box 4349, Stanford, California 94305.


reference:
John Alan McDonald. Projection pursuit regression with the Orion I workstation, 1982. a 20 minute, 16mm color sound film, which demonstrates programs described in McDonald (1982) It is available for loan from: Jerome H. Friedman, Computation Research Group, Bin # 88, SLAC, P.O. Box 4349, Stanford, California 94305.


reference:
John Alan McDonald. Antelope: data analysis with object-oriented programming and constraints. In Proc. of the 1986 Joint Statistical Meetings, Stat. Comp. Sect., 1986.


reference:
John Alan McDonald. Interactive graphics for data analysis. In W. S. Cleveland and M. E. McGill, editors, Dynamic Graphics for Statistics, pages 247--275. Wadsworth and Brooks/Cole, Belmont, CA, 1988. Ph.D. thesis, Dept. of Statistics, Stanford, June 1982.


reference:
C. M. Newton. Graphics: from alpha to omega in data analysis. In P. C. C. Wang, editor, Graphical Representation of Multivariate Data. Academic Press, New York, 1978. Proceedings of the Symp. on Graphical Representation of Multivariate Data, Naval Postgraduate School, Monterey, Ca., Feb 24, 1978.


reference:
George G. Robertson, Jock D. Mackinlay, and Stuart K. Card. Cone Trees: animated 3d visualizations of hierarchical information. Technical Report SSL-90-79, Xerox PARC, 3333 Coyote Hill Road, Palo Alto, CA 94304, 1990.


reference:
P. Shippert, G. Bradshaw, and S. Willis. Washington Image and Spectral Package (WISP) Preliminary Documentation. Remote Sensing Laboratory, Dept. of Geological Sciences, U. of Washington, Seattle, WA 98195, May 11, 1989.


reference:
Edward J. Wegman. Hyperdimensional data analysis using parallel coordinates. JASA, 85(411):664--675, 1990.


reference:
Andrew Sears , Ben Shneiderman, High precision touchscreens: design strategies and comparisons with a mouse, International Journal of Man-Machine Studies, v.34 n.4, p.593-613, April 1991


reference:
Kim J. Vicente , Brian C. Hayes , Robert C. Williges, Assaying and isolating individual differences in searching a hierarchical file system, Human Factors, v.29 n.3, p.349-359, June 1987


reference:
A. Brüggemann-Klein , D. Wood, Drawing trees nicely with TeX, Electronic Publishing-Origination, Dissemination, and Design, v.2 n.2, p.101-115, July 1989


reference:
E. Hoadley, Investigating the effects of color, Communications of the ACM, v.33 n.2, p.120-125, Feb. 1990


reference:
Chen Ding , Prabhaker Mateti, A Framework for the Automated Drawing of Data Structure Diagrams, IEEE Transactions on Software Engineering, v.16 n.5, p.543-557, May 1990


reference:
David V. Beard and John Q. Walker II. Navigational techniques to improve the display of large two-dimensional spaces. Behavior andamp; Information Technology, 9(6):451--466, 1990.


reference:
Richard Chimera, Kay Wolman, Sharon Mark, and Ben Shneiderman. Evaluation of three interfaces for browsing hierarchical tables of contents. Technical Report CAR-TR-539, CS-TR-2620, University of Maryland, College Park, February 1991.


reference:
Donna J. Cox. The art of scientific visualization. Academic Computing, page 20, March 1990.


reference:
Richard Ellson. Visualization at work. Academic Computing, page 26, March 1990.


reference:
Tyson R. Henry and Scott E. Hudson. Viewing large graphs. Technical Report 90--13, University of Arizona, May 1990.


reference:
Tomihisa Kamada. On Visualization of Abstract Objects and Relations. Ph.D. thesis, University of Tokyo, Department of Information Science, 7-3-1 Hongo, Bunkyoku, Tokyo, 113 JAPAN, December 1988.


reference:
Werner Kuhn. Editing spatial relations. In Proceedings of the 4th International Symposium on Spatial Data Handling, pages 423--432, Zurich, Switzerland, 1990.


reference:
Lindsay W. MacDonald. Using colour effectively in displays for computer-human interface. DISPLAYS, pages 129--142, July 1990.


reference:
John F. Rice. Ten rules for color coding. Information Display, 7(3):12--14, March 1991.


reference:
William R. Feeny, Gray scale diagrams as business charts, Proceedings of the 2nd conference on Visualization '91, October 22-25, 1991, San Diego, California


reference:
Andreas Buja , John Alan McDonald , John Michalak , Werner Stuetzle, Interactive data visualization using focusing and linking, Proceedings of the 2nd conference on Visualization '91, October 22-25, 1991, San Diego, California


reference:
T. Mihalisin , J. Timlin , J. Schwegler, Visualization and analysis of multi-variate data: a technique for all fields, Proceedings of the 2nd conference on Visualization '91, October 22-25, 1991, San Diego, California


reference:
Brian Johnson , Ben Shneiderman, Tree-Maps: a space-filling approach to the visualization of hierarchical information structures, Proceedings of the 2nd conference on Visualization '91, October 22-25, 1991, San Diego, California


reference:
D. Beard and J. Walker II. Navigational techniques to improve the display of large two-dimensional spaces. Behavior andamp; Information Technology, 9(6):451--466, 1990.


reference:
D. Cox. The art of scientific visualization. Academic Computing, p. 20, March 1990.


reference:
R. Ellson. Visualization at work. Academic Computing, p. 26, March 1990.


reference:
T. Henry and S. Hudson. Viewing large graphs. Technical Report 90--13, University of Arizona, May 1990.


reference:
B. Shneiderman. Personal Communication, 1991.


reference:
W. B. Frakes , D. J. Lubinsky , D. N. Neal, Experimental evaluation of a test coverage analyzer for C and C++, Journal of Systems and Software, v.16 n.2, p.135-139, Oct. 1991


reference:
Jon Bentley, Programming pearls, ACM Press, New York, NY, 1986


reference:
B. W. Kernighan , D. M. Ritchie, The C programming language, Prentice-Hall, Inc., Upper Saddle River, NJ, 1978


reference:
Susan L. Graham , Peter B. Kessler , Marshall K. Mckusick, Gprof: A call graph execution profiler, Proceedings of the 1982 SIGPLAN symposium on Compiler construction, p.120-126, June 23-25, 1982, Boston, Massachusetts, United States


reference:
A. G. Hume and M. D. McIlroy UNIX Research System Programmer's Manual, Tenth Edition Holt Dryden Saunders, 1990.


reference:
Peter J. Weinberger, "Cheap Dynamic Instruction Counting," ATandamp;T Bell Laboratories Technical Journal, Vol. 63, No. 8, pp. 1815--26, October 1984.


reference:
IRIX User's Reference Manual, Volume II, Version 5.2, Silicon Graphics, Inc., Mountain View, CA, 1990.


reference:
Joseph L. Steffen, "Interactive Examination of a C Program with Cscope," USENIX Dallas 1985 Winter Conference Proceedings, USENIX Association, El Cerrito, CA, 170--175, 1985.


reference:
Stephen G. Eick, "Dynamic Graphics for Software Visualization," Interface '92 Proceedings, College Station, TX, 1992.


reference:
Richard A. Becker, William S. Cleveland, and G. Wed, "The Use of Brushing and Rotation for Data Analysis," pp. 247--275 in Dynamic Graphics for Statistics, William S. Cleveland and McGill (Eds.), Wadsworth, 1988.


reference:
Stephen G. Eick and Joseph L. Steffen, Visualizing Code Projiling Line Count Statistics, video tape, ATandamp;T Bell Laboratories, under preparation.


reference:
Clifford Burgess , Kathleen Swigger, A graphical database interface for casual, naive users, Information Processing and Management: an International Journal, v.22 n.6, p.511-521, Dec. 1986


reference:
Jeff Coklin , Michael L. Begeman, gIBIS: a tool for all reasons, Journal of the American Society for Information Science, v.40 n.3, p.200-213, May 1989


reference:
Bruce R. Schatz , Michael A. Caplinger, Searching in a Hyperlibrary, Proceedings of the Fifth International Conference on Data Engineering, p.188-197, February 06-10, 1989


reference:
T. Kohonen, Self-organization and associative memory: 3rd edition, Springer-Verlag New York, Inc., New York, NY, 1989


reference:
Doyle, L. B. Indexing and abstracting by association. American Documentation, October, 1962, 378--390.


reference:
Ritter, H. andamp; Kohonen, T. Self-organizing semantic maps. Biological Cybernetics, Vol. 61, 241--254, 1989.


reference:
Kohonen, T. The self-organizing map. Proceeding of the IEEE. 78(9), 1464--1480, 1990.


reference:
Nielsen, J. Miniatures versus icons as a visual cache for videotex browsing. Behavior andamp; Information Technology. 9(6), 441--449, 1990.


reference:
Rousseeuw, P. J. A visual display for hierarchical classification. Data Analysis and Informatics, IV. Proceedings of the Fourth International Symposium (Oct. 9--11, 1985, Versailles, France). p. 743--748.


reference:
Fairchild, K. M.; Poltrock, S. E.; andamp; Furnas, G. W. Sem Net: Three-dimensional graphic representations of large knowledge bases. In: Cognitive Science and its applications for human-computer interaction (ed. by R. Guindon)., 201--233, 1988.


reference:
Sammon, J. W. A nonlinear mapping for data structure analysis. IEEE Transactions on Computers. 18(5), 401--409, 1969.


reference:
White, H. D., andamp; Griffith, B. C. Author cocitation: A literature measure of intelligent structure. Journal of the American Society for Information Science, 32, 163--171, 1981.


reference:
Lin, X. Self-organizing semantic maps for information retrieval. Doctoral Dissertation, University of Maryland at College Park, 1992.


reference:
David Laur , Pat Hanrahan, Hierarchical splatting: a progressive refinement algorithm for volume rendering, ACM SIGGRAPH Computer Graphics, v.25 n.4, p.285-288, July 1991


reference:
Lee Westover, Interactive volume rendering, Proceedings of the 1989 Chapel Hill workshop on Volume visualization, p.9-16, May 1989, Chapel Hill, Noth Carolina, United States


reference:
David M. Gay, Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach, ACM Transactions on Mathematical Software (TOMS), v.9 n.4, p.503-524, Dec. 1983


reference:
[GL91] Graphics Programming Library Guide. Silicon Graphics, Inc. 1991.


reference:
[Max91] Max, Nelson, An Optimal Filter for Image Reconstruction, in Graphics Gem II, James Arvo (ed), Academic Press, New York, pp. 101--104.


reference:
Elizabeth C. Tyler , Martha R. Horton , Philip R. Krause, A review of algorithms for molecular sequence comparison, Computers and Biomedical Research, v.24 n.1, p.72-96, Feb. 1991


reference:
Michael Barnsley, Fractals everywhere, Academic Press Professional, Inc., San Diego, CA, 1988


reference:
Nolan G. Core , Elizabeth W. Edmiston , Joel H. Saltz , Roger M. Smith, Supercomputers and biological sequence comparison algorithms, Computers and Biomedical Research, v.22 n.6, p.497-515, Dec. 1989


reference:
H. S. Bilofsky and C. Bruks, "The GenBank genetic sequence data bank," Nucleic Acids Research, Vol. 16, no. 5, pp. 1861--1863, 1988.


reference:
G. N. Cameron, "The EMBL data library," Nucleic Acids Research, Vol. 16, no. 5, pp. 1865--1867, 1988.


reference:
E. Hamori and J. Ruskin, "H curves, a novel method of representation of nucleotide series especially suited for long DNA sequences," The Journal of Biological Chemistry, Vol. 258, pp. 1318--1327, July 1983.


reference:
S. Karlin, M. Morris, G. Ghandour, and M.-Y. Leung, "Efficient algorithm for molecular sequence analysis," Proceedings National Academy of Sciences, Vol. 85, pp. 841--845, February 1988.


reference:
M. S. Waterman, "Identification of common molecular subsequences," Journal of Molecular Biology, no. 147, pp. 159--197, 1981.


reference:
M. S. Waterman, "Efficient sequence alignment algorithms," Journal of Theoretical Biology, no. 108, pp. 333--337, 1984.


reference:
O. Gotoh, "An improved algorithm for matching biological sequences," Journal of Molecular Biology, no. 162, pp. 705--708, 1982.


reference:
H. J. Jeffrey, "Chaos games representation of genetic sequences," Nucleic Acids Research, Vol. 18, no. 8, pp. 2163--2170, 1990.


reference:
H. J. Jeffrey, "Chaos game visualization of sequences," Computer andamp; Graphics, Vol. 16, no. 1, pp. 25--33, 1992.


reference:
H.-O. Peitgen, H. Jürgens, and D. Saupe, Chaos and Fractals: New Frontiers of Science. Springer-Verlag, New York, 1992.


reference:
D. Wu. Technical Report, Department of Computer Science, Illinois Institute of Technology, 1992.


reference:
C. A. Gunter , D. S. Scott, Semantic domains, Handbook of theoretical computer science (vol. B): formal models and semantics, MIT Press, Cambridge, MA, 1991


reference:
Tom Nadas , Alain Fournier, GRAPE: An environment to build display processes, ACM SIGGRAPH Computer Graphics, v.21 n.4, p.75-84, July 1987


reference:
R. B. Haber , B. Lucas , N. Collins, A data model for scientific visualization with provisions for regular and irregular grids, Proceedings of the 2nd conference on Visualization '91, October 22-25, 1991, San Diego, California


reference:
William Hibbard , Charles R. Dyer , Brian Paul, Display of scientific data structures for algorithm visualization, Proceedings of the 3rd conference on Visualization '92, October 19-23, 1992, Boston, Massachusetts


reference:
W. J. Schroeder , W. E. Lorensen , G. D. Montanaro , C. R. Volpe, VISAGE: an object-oriented scientific visualization system, Proceedings of the 3rd conference on Visualization '92, October 19-23, 1992, Boston, Massachusetts


reference:
J. P. M. Hultquist , E. L. Raible, SuperGlue: a programming environment for scientific visualization, Proceedings of the 3rd conference on Visualization '92, October 19-23, 1992, Boston, Massachusetts


reference:
Bertin, J., 1983; Semiology of Graphics. W. J. Berg, Tr. University of Wisconsin Press.


reference:
Davey, B. A. and H. A. Priestly, 1990; Introduction to Lattices and Order. Cambridge University Press.


reference:
Hibbard, W. L., and C. R. Dyer, 1994; A lattice theory of data display. Tech. Rep. # 1226, Computer Sciences Department, University of Wisconsin-Madison. Also available as compressed postscript files by anonymous ftp from iris.ssec.wisc.edu (144.92.108.63) in the pub/lattice directory.


reference:
Potmesil, M. and E. Hoffert, 1987; FRAMES: Software tools for modeling, animation and rendering of 3D scenes, Computer Graphics 21(4), 75--84.


reference:
Robertson, P. K., R. A. Earnshaw, D. Thalman, M. Grave, J. Gallup and E. M. De Jong, 1994; Research issues in the foundations of visualization. Computer Graphics and Applications 14(2), 73--76.


reference:
Schmidt, D. A., 1986; Denotational Semantics. Wm.C.Brown.


reference:
Scott, D. S., 1971; The lattice of flow diagrams. In Symposium on Semantics of Algorithmic Languages, E. Engler. ed. Springer-Verlag, 311--366.


reference:
Scott, D. S., 1976; Data types as lattices. Siam J. Comput, 5(3), 522--587.


reference:
Treinish, L. A., 1991; SIGGRAPH '90 workshop report: data structure and access software for scientific visualization. Computer Graphics 25(2), 104--118.


reference:
Clifford Beshers , Steven Feiner, Auto Visual: Rule-Based Design of Interactive Multivariate Visualizations, IEEE Computer Graphics and Applications, v.13 n.4, p.41-49, July 1993


reference:
Alfred Inselberg , Bernard Dimsdale, Parallel coordinates: a tool for visualizing multi-dimensional geometry, Proceedings of the 1st conference on Visualization '90, October 23-26, 1990, San Francisco, California


reference:
Stuart Smith , R. Daniel Bergeron , Georges G. Grinstein, Stereophonic and surface sound generation for exploratory data analysis, Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people, p.125-132, April 01-05, 1990, Seattle, Washington, United States


reference:
Andrews, D. F., "Plots of high dimensional data", Biometrics, Vol. 28, pp. 125--136, 1972.


reference:
Becker, R. A., Cleveland, W. S., "Brushing Scatterplots," from Dynamic Graphics for Statistics (eds. W. S. Cleveland and M. E. McGill), Wadsworth, Inc., Belmont, CA, 1988.


reference:
Chernoff, H., "The use of faces to represent points in k-dimensional space graphically," Journal of the American Statistical Association, Vol. 68, pp. 361--368, 1973.


reference:
Everitt, B. S., Graphical Techniques for Multivariate Data, Heinemann Educational Books, Ltd., London, 1978.


reference:
Grinstein, G., Pickett, R., Williams, M. G., "EXVIS: an exploratory visualization environment," Graphics Interface '89, 1989.


reference:
Littlefield, R. J., "Using the GLYPH concept to create user-definable display formats," Proc. NCGA '83, pp. 697--706, 1983.


reference:
Siegel, J. H., Farrell, E. J., Goldwyn, R. M., Friedman, H. P., "The surgical implication of physiologic patterns in myocardial infarction shock," Surgery, Vol. 72, pp. 126--141, 1972.


reference:
Ward, M. O., "N-dimensional brushes: gaining insights into relationships in N-D data," submitted for publication, 1993.


reference:
Ward, M. O., LeBlanc, J. T., Tipnis, R., "N-Land: a graphical tool for exploring N-dimensional data," to be published in Proceedings of CG International '94, 1994.


reference:
K. Mehlhorn and S. Naher. "The LEDA Platform of Combinatorial and Geometric Computing". Cambridge University Press, 1st edition, 1999. http //www.mpi-sb.mpg.de/~mehlhorn/LEDAbook.html.


reference:
E. Raisz: General Cartography. New York: McGraw-Hill, 1948


reference:
E. Raisz: Principles of Cartography. New York: McGraw-Hill, 1962


reference:
J. Hunter and J.C. Young, "A Technique for the Construction of Quantitative Cartograms by Physical Accretion Models," the Professional Geographer, vol. 20, pp. 402-406, 1968.


reference:
H. Gray Funkhouser, "Historical Development of the Geographical Representation of Statistical Data," Osiris, vol 3., pp. 269-403, 1937


reference:
B.D.Dent: Cartography: Thematic Map Design, fourth ed., chapter 10. Dubuque, Iowa: William C. Brown, 1996


reference:
C.B. Jackel, "Using Arcview to Create Contiguous and Noncontinguous Area Cartograms, " Cartography and Geographics Information Systems, vol. 24, no. 2, pp. 101-109, 1997.


reference:
B. White, I. Gregory, and H. Southall, "Analysing and Visualising Long-Term Change," GIS Research UK, Proc. Sixth Nat'l Conf., 1998.


reference:
B. Dent, "A Note on the Importance of Shape in Cartogram Communication," The J. Geography, vol. 71, no. 7, pp. 393-401, October, 1972.


reference:
B. Dent, "Communication Aspects of Value-by-Area Cartograms," the Am. Cartographer, vol. 2, no. 2, pp. 154-168, Oct. 1975


reference:
M.S.T. Carpendale, D.J. Cowperthwaite, M. Tigges, A. Fall, and F.D. Fracchia, "The TARDIS: A Visual Exploration Environment for Landscape Dynamics," Visual Data Exploration and Analysis VI, Proc. SPIE, vol. 3643, pp. 110-119, Jan. 1999


reference:
T.A. Keahey, "Area-normalized Thematic Views," Proc. Int'l Cartography Assembly, Aug. 1999


reference:
C. Cauvin, C. Schneider, and g. Cherrier, "Cartographic Transformations and the Piezopleth Method," The Cartographic J., vol. 26, no. 2, pp. 96-104.


reference:
D. Anderson, E. Anderson, N. Lesh, J. marks, K. Perlin, D. Ratajczak, and K. Ryall, "Human-Guided Greedy Search: Combining Information Visualization and Heristic Search," Proc. Workshop New Paradigms in Information Visualization and Manipulation (NPIVM'99), pp. 21-25, 1999


reference:
L. Kehrer and C. Meinecke, Perceptual Organization of Visual patterns: The Segmentation of Textures, chapter 2. London: Academic Press, 1995.


reference:
S. Berchtold, D.A. Keim, and H.P. Kriegel, "Using Extended Feature Objects for Partial Similarity Retrieval," VLDB J., vol. 6, no. 4, pp. 333-348, 1997


reference:
N. Weinstein: The Joy of Fourier Analysis. Hillsdale, N.J.: Erlbaum, 1980.


reference:
Jeannette G. Neal , Stuart C. Shapiro, Intelligent multi-media interface technology, Intelligent user interfaces, ACM Press, New York, NY, 1991


reference:
Yigal Arens , Lawrence Miller , Norman Sondheimer, Presentation design using an integrated knowledge base, Intelligent user interfaces, ACM Press, New York, NY, 1991


reference:
Steven Feiner, An architecture for knowledge-based graphical interfaces, Intelligent user interfaces, ACM Press, New York, NY, 1991


reference:
Kathleen R. McKeown, Discourse strategies for generating natural-language text, Artificial Intelligence, v.27 n.1, p.1-41, Sept. 1985


reference:
Jeffrey D. Ullman, Principles of Database Systems, W. H. Freeman andamp; Co., New York, NY, 1983


reference:
R. A. Gargan, Jr. , J. W. Sullivan , S. W. Tyler, Multimodal response planning: an adaptive rule based approach, Proceedings of the SIGCHI conference on Human factors in computing systems, p.229-234, May 15-19, 1988, Washington, D.C., United States


reference:
Bertha, Jacques. Semiology of Graphics. The University of Wisconsin Press, 1983.


reference:
Kosslyn, S.M. "Graphics and Humm~ Information Processing - A Review of Five Books". Journal of the American Statistical Association 80, 391 (September 1985), 499-512.


reference:
Roth, S.F., Mattis, J.A., and Mesnard, X.A. Graphics and Natural Language as Components of Automatic Explanation. In Architectures for Intelligent Interfaces: Elements and Prototypes, Sullivan, J. and Tyler, S., Ed., Addison-Wesley, Reading, Mass, 1990.


reference:
Norman I. Badler , Kamran H. Manoochehri , David Baraff, Multi-dimensional input techniques and articulated figure positioning by multiple constraints, Proceedings of the 1986 workshop on Interactive 3D graphics, p.151-169, January 1987, Chapel Hill, North Carolina, United States


reference:
Cary B. Phillips , Norman I. Badler, JACK: a toolkit for manipulating articulated figures, Proceedings of the 1st annual ACM SIGGRAPH symposium on User Interface Software, p.221-229, October 17-19, 1988, Alberta, Canada


reference:
D. Weimer , S. K. Ganapathy, A synthetic visual environment with hand gesturing and voice input, Proceedings of the SIGCHI conference on Human factors in computing systems: Wings for the mind, p.235-240, March 1989


reference:
D. J. Sturman , D. Zeltzer , S. Pieper, Hands-on interaction with virtual environments, Proceedings of the 2nd annual ACM SIGGRAPH symposium on User interface software and technology, p.19-24, November 13-15, 1989, Williamsburg, Virginia, United States


reference:
Chen, Michael, S. Joy Mountford, and Abigail Sellen. A study in interactive 3-D rotation using 2-D control devices. Proceedings of SIGGRAPH'88 (Atlanta, Georgla~ August 1988). In Computer Graphics 25, 4 (August 1988), 121-129.


reference:
Fairchild, Kim M., Steven E. Poltrock, and George W. Furnas. Semnet: three-dimensional graphic representations of large knowledge bases. In Cognitive science and its applications for human-computer interaction, Guindon, R. (ed), Lawrence Erlbaum, 1988.


reference:
Mackinlay, Jock D., Stuart K. Card, and George G. Robertson. A semantic analysis of the design space of input devices. Human-Computer Interaction, to appear in vol. 5, 1990.


reference:
Pew, R. W. Human perceptual-motor performance. In Human Information Processing: Tutorials in Performance and Cognition, Kantowitz, B. H. (ed), Lawrence Erlbaum, 1974, 1-40.


reference:
William E. Lorensen , Harvey E. Cline, Marching cubes: A high resolution 3D surface construction algorithm, Proceedings of the 14th annual conference on Computer graphics and interactive techniques, p.163-169, August 1987


reference:
Ned Greene , Paul S. Heckbert, Creating raster Omnimax images from multiple perspective views using the elliptical weighted average filter, IEEE Computer Graphics and Applications, v.6 n.6, p.21-27, June 1986


reference:
R. S. Gallagher , J. C. Nagtegaal, An efficient 3-D visualization technique for finite element models and other coarse volumes, Proceedings of the 16th annual conference on Computer graphics and interactive techniques, p.185-194, July 1989


reference:
James F. Blinn, Light reflection functions for simulation of clouds and dusty surfaces, Proceedings of the 9th annual conference on Computer graphics and interactive techniques, p.21-29, July 26-30, 1982, Boston, Massachusetts, United States


reference:
James T. Kajiya , Brian P Von Herzen, Ray tracing volume densities, Proceedings of the 11th annual conference on Computer graphics and interactive techniques, p.165-174, January 1984


reference:
Thomas Porter , Tom Duff, Compositing digital images, Proceedings of the 11th annual conference on Computer graphics and interactive techniques, p.253-259, January 1984


reference:
Gregory D. Abram , Turner Whitted, Building block shaders, Proceedings of the 17th annual conference on Computer graphics and interactive techniques, p.283-288, September 1990


reference:
Drebin, Robert, Lome Carpenter, Pat Hanrahan. Volume Rendering. Proceedings of SIG- GRAPH'88 (Atlanta, Georgia, August 1-5, 1988). In Computer Graphics 22, 4(August 1988), 65-74.


reference:
Frieder, Gideon, Dan Gordon, Anthony Reynolds. Back-to-Front Display of Voxel-Based Objects. IEEE Computer Graphics and Applications 5, l(January 1985).


reference:
Lenz, Reiner, Bjom Gudnumdsson, Bjom Lindskog, Per Danielsson. "Display of Density Volumes", IEEE Computer Graphics and Applications 6, 7(Juty 1986).


reference:
Sabella, Paolo. A Rendering Algorithm for Visualizing 3D Scalar Data. Proceedings of SIG- GRAPH'S8 (Atlanta, Georgia, August 1-5, 1988). In Computer Graphics 22, 4(August 1988), 51-58.


reference:
Upson, Craig, Michael Keller. VBUFFER: Visible Volume Rendering. Proceedings of SIG- GRAPH'88 (Atlanta, Georgia, August 1-5, 1988). In Computer Graphics 22, 4(August 1988), 59-64.


reference:
VanHook, Tim. Personal Communication. September I986.


reference:
C. M. Beshers , S. K. Feiner, Real-time 4D animation on a 3D graphics workstation, Proceedings on Graphics interface '88, p.1-7, December 1989, Edmonton, Alberta, Canada


reference:
Thomas G. Zimmerman , Jaron Lanier , Chuck Blanchard , Steve Bryson , Young Harvill, A hand gesture interface device, Proceedings of the SIGCHI/GI conference on Human factors in computing systems and graphics interface, p.189-192, April 05-09, 1987, Toronto, Ontario, Canada


reference:
A. Michael Noll, A computer technique for displaying n-dimensional hyperobjects, Communications of the ACM, v.10 n.8, p.469-473, Aug. 1967


reference:
William C. Thibault , Bruce F. Naylor, Set operations on polyhedra using binary space partitioning trees, ACM SIGGRAPH Computer Graphics, v.21 n.4, p.153-162, July 1987


reference:
C. M. Beshers , S. Feiner, Scope: automated generation of graphical interfaces, Proceedings of the 2nd annual ACM SIGGRAPH symposium on User interface software and technology, p.76-85, November 13-15, 1989, Williamsburg, Virginia, United States


reference:
F. W. Scheifler , J. Gettys , R. Newman, X Window system: C Library and protocol reference, Digital Press, Newton, MA, 1988


reference:
Sara Bly, Presenting information in sound, Proceedings of the 1982 conference on Human factors in computing systems, p.371-375, March 15-17, 1982, Gaithersburg, Maryland, United States


reference:
Steven M. Rubin , Turner Whitted, A 3-dimensional representation for fast rendering of complex scenes, Proceedings of the 7th annual conference on Computer graphics and interactive techniques, p.110-116, July 14-18, 1980, Seattle, Washington, United States


reference:
BANC78 Banchoff, T. "Computer Animation and the Geometry of Surfaces in 3- and 4-Space." Proc. Int. Cong. of Math, 1978, 1005-1013.


reference:
FEIN82 Feiner, S., D. Salesin, and T. Banchoff. "DIAL: A diagrammatic animation language." IEEE Computer Graphics and Applications, 2:7, September 1982, 43-54.


reference:
HULL89 Hull, J. Options, Futures, and Other Derivative Securities, Prentice-Hall, NJ, 1989.


reference:
KILP76 Kilpatrick, P.J. The Use of a Kinesthetic Supplement in an Interactive Graphics System, Ph.D. Thesis, Univ. of North Carolina, Chapel Hi!l, 1976.


reference:
OUHY89 Ouh-young, M., D. Beard and F. Brooks, Jr. "Force Display Performs Better than Visual Display in a Simple 6-D Docking Task." Proc. IEEE Robotics and Automation Conf., May 1989, 1462-6.


reference:
STER89 StereoGraphics, CrystalEyes product literature, StereoGraphics Corp., San Rafael, CA, 1989.


reference:
SUTH65 Sutherland, I. "The Ultimate Display." Proc. IFIP 65, 1965, 506-508


reference:
TEKT87 Tektronix. "3D Stereoscopic Color Graphics Workstation (TEK 4126 product literature)." Beaverton, OR, 1987.


reference:
VICK70 Vickers, D.L., "Head-Mounted Display Terminal." Proc. 1970 IEEE International Computer Group Conference, 1970. Reprinted in J.C. Beatty and K.S. Booth, Tutorial: Computer Graphics, 2rid Ed., IEEE Computer Society Press, Silver Spring, MD, 1982.


reference:
VPL89 VPL Research Inc. "EyePhone System Preliminary Specification v.4." Redwood City, CA, July 1989.


reference:
Herman Chernoff. The use of fa.ces to represent points in k-dimensional space graphically. Journal of the American Statistical Association, 68:361- 368, 1973.


reference:
l~.W. Oldford. Object-oriented software representations for statistical da.ta. Journal of Econometrics, pages 227-246, 1988.


reference:
Kurt Mehlhorn, Data structures and algorithms 3: multi-dimensional searching and computational geometry, Springer-Verlag New York, Inc., New York, NY, 1984


reference:
Esther M. Arkin , L. Paul Chew , David P. Huttenlocher , Klara Kedem , Joseph S. B. Mitchell, An efficiently computable metric for comparing polygonal shapes, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.129-137, January 22-24, 1990, San Francisco, California, United States


reference:
L. Paul Chew , Robert L. (Scot) Dyrsdale, III, Voronoi diagrams based on convex distance functions, Proceedings of the first annual symposium on Computational geometry, p.235-244, June 05-07, 1985, Baltimore, Maryland, United States


reference:
Helmut Alt , Kurt Mehlhorn , Hubert Wagener , Emo Welzl, Congruence, similarity and symmetries of geometric objects, Discrete and Computational Geometry, v.3 n.3, p.237-256, Jan., 1988


reference:
Berthold Klaus Paul Horn, Robot vision, MIT Press, Cambridge, MA, 1986


reference:
At Atallah, M.J. "A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons", Information Processing Letters, vol. 17, 207-209, 1983.


reference:
EGS Edelsbrunner, H., Guibas, L.J and Sharir, M. "The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications", Tech. Report UIUCDCDS-R-87-1390, Dept. of Comp. Sci., University of Illinois at Urbana-Champaign, November 1987.


reference:
HKS Huttenlocher, D.P., Kedem, K. and Sharir, M. "Efficiently Computing the Hausdorff Distance for Point Sets Under Translation", in preparation.


reference:
Kl Klein, F. Elementary Mathematics from an Advanced Standpoint: Geometry, MacMillan, New York, 1939.


reference:
OS Overmars, M.H, and Sharir, M. "Merging Visibility Graphs", to appear in this Proceedings of ACM Symposium on Computational Geometry, 1990.


reference:
LS Leven, D. and Sharir, M. "Planning a purely translational motion for a convex polygonal object in two dimensional space using Generalized Voronoi diagrams', Discrete and Computational Geometry, vol 2, pp. 9-31, 1987.


reference:
Ro Royden, H.L. Real Analysis, Macmillan, New York, 1968.


reference:
Sp Spivak, M. A Comprehensive Introduction to Differential Geometry, Volume 3, Publish or Perish Press, Berkeley Calif., 1979.


reference:
Thomas W. Malone , Kenneth R. Grant , Kum-Yew Lai , Ramana Rao , David Rosenblitt, Semistructured messages are surprisingly useful for computer-supported coordination, ACM Transactions on Information Systems (TOIS), v.5 n.2, p.115-131, April 1987


reference:
Paul E. Lehner , Deborah A. Zirk, Cognitive factors in user/expert-system interaction, Human Factors, v.29 n.1, p.97-109, Feb. 1987


reference:
Susan F. Ehrlich, Strategies for encouraging successful adoption of office communication systems, ACM Transactions on Information Systems (TOIS), v.5 n.4, p.340-357, Oct. 1987


reference:
Sunil Sarin , Irene Greif, Computer-based real-time conferencing systems, Computer, v.18 n.10, p.33-45, Oct. 1985


reference:
Jonathan Grudin, Why CSCW applications fail: problems in the design and evaluation of organization of organizational interfaces, Proceedings of the 1988 ACM conference on Computer-supported cooperative work, p.85-93, September 26-28, 1988, Portland, Oregon, United States


reference:
Cimr83 Cimral, J.J., "Integrating coordination support into automated information systems," Master's thesis, Dept. of Electrical Engineering and Computer Science, Massachusetts institute of Technology, Cambridge, May 1983.


reference:
Gian89 Gianatasio, D., Utility finds free times, places for meetings, Digital Review, Vol. 6, No. 1, Jan. 9, 1989, 26 (1).


reference:
Jonk67 The Jonker Information Systems Manual, Jonker Corporation, Gaithersburg, MD, 1967.


reference:
Kell82 Kelly, J.F. and Chapanis, A., "How Professional Personnel Keep Their Calendars: Implications for Computerization," Journal of Occupational Psychology, 1982, 55, 241-256.


reference:
MacK76 MacKenzie, R.A., Time-Trap: How to get more done in less time, MacGraw- Hill, 1976.


reference:
Thom88 Thompson, K.M., WordPerfect Office desktop organizer includes e-mail, group scheduling, PC Magazine, Vol.7, No. 21, Dec 13, 1988, 38 (1).


reference:
Utti90 Utting, K., "Data Dock: A New Style of Computing," IRIS TR90-2, 1990.


reference:
Wine62 Wirier, B.J., Statistical Principles in Experimental Design, MacGraw-Hill, 2nd Edition, 1962.


reference:
Zade65 Zadeh, L. A., "Fuzzy Sets," Information Control, Vol. 8, 1965, 338-353.


reference:
Zade73 Zadeh, L. A., "Outline of a New Approach to the Analysis of Complex Systems and Decision-Making Approach," IEEE Transactions on Systems, Man, and Cybernetics, Vol. SME-3, No.l, Jan. 1973, 28-45.


# articles

title:
Self-organized formation of topologically correct feature maps


title:
Task-analytic approach to the automated design of graphic presentations

abstract:
BOZ is an automated graphic design and presentation tool that designs graphics based on an analysis of the task for which a graphic is intended to support. When designing a graphic, BOZ aims to optimize two ways in which graphics help expedite human performance of information-processing tasks: (1) allowing users to substitute simple perceptual inferences in place of more demanding logical inferences, and (2) streamlining users' search for needed information. BOZ analyzes a logical description of a task to be performed by a human user and designs a provably equivalent perceptual task by substituting perceptual inferences in place of logical inferences in the task description. BOZ then designs and renders an accompanying graphic that encodes and structures data such that performance of each perceptual inference is supported and visual search is minimized. BOZ produces a graphic along with a perceptual procedure describing how to use the graphic to complete the task. A key feature of BOZ's approach is that it is able to design different presentations of the same information customized to the requirements of different tasks. BOZ is used to design graphic presentations of airline schedule information to support five different airline reservation tasks. Reaction time studies done with real users for one task and graphic show that the BOZ-designed graphic significantly reduces users' performance time to the task. Regression analyses link the observed efficiency savings to BOZ's two key design principles: perceptual inference substitutions and pruning of visual search.

keywords:
automated design, graphic design, graphic user interface, task analysis, visual languages


title:
The perspective wall: detail and context smoothly integrated


title:
Cone Trees: animated 3D visualizations of hierarchical information


title:
Tree visualization with tree-maps: 2-d space-filling approach


keywords:
Information Systems, Mathematics of Computing, DISCRETE MATHEMATICS, Design, Human Factors,user interface


title:
A coherent projection approach for direct volume rendering


title:
To see, or not to see- is That the query?


title:
Screen management in hypertext systems with rubber sheet layouts


title:
DOODLE: a visual language for object-oriented databases

abstract:
In this paper we introduce DOODLE, a new visual and declarative language for object-oriented databases. The main principle behind the language is that it is possible to display and query the database with arbitrary pictures . We allow the user to tailor the display of the data to suit the application at hand or her preferences. We want the user-defined visualizations to be stored in the database, and the language to express all kinds of visual manipulations. For extendibility reasons, the language is object-oriented. The semantics of the language is given by a well-known deductive query language for object-oriented databases. We hope that the formal basis of our language will contribute to the theoretical study of database visualizations and visual query languages, a subject that we believe is of great interest, but largely left unexplored.


title:
Bead: explorations in information visualization

abstract:
We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling. Many areas of scientific research involve complex multivariate data. One example of this is Information Retrieval. Document comparisons may be done using a large number of variables. Such conditions do not favour the more well-known methods of visualization and graphical analysis, as it is rarely feasible to map each variable onto one aspect of even a three-dimensional, coloured and textured space. Bead is a prototype system for the graphically-based exploration of information. In this system, articles in a bibliography are represented by particles in 3-space. By using physically-based modelling techniques to take advantage of fast methods for the approximation of potential fields, we represent the relationships between articles by their relative spatial positions. Inter-particle forces tend to make similar articles move closer to one another and dissimilar ones move apart. The result is a 3D scene which can be used to visualize patterns in the high-D information space.

keywords:
visualization, information retrieval, particle systems, N-body problem


title:
The dynamic HomeFinder: evaluating dynamic queries in a real-estate information exploration system

abstract:
We designed, implemented, and evaluated a new concept for visualizing and searching databases utilizing direct manipulation called dynamic queries . Dynamic queries allow users to formulate queries by adjusting graphical widgets, such as sliders, and see the results immediately. By providing a graphical visualization of the database and search results, users can find trends and exceptions easily. User testing was done with eighteen undergraduate students who performed significantly faster using a dynamic queries interface compared to both a natural language system and paper printouts. The interfaces were used to explore a real-estate database and find homes meeting specific search criteria.

keywords:
task-centered, walkthrough, dynamic queries, case study


title:
Optimal linear labelings and eigenvalues of graphs


title:
A collision-based model of spiral phyllotaxis

keywords:
cactus, flower head, modeling of plants, realistic image synthesis, spiral phyllotaxis


abstract:
A fisheye lens is a very wide angle lens that shows places nearby in detail while also showing remote regions in successively less detail. This paper describes a system for viewing and browsing planar graphs using a software analog of a fisheye lens. We first show how to implement such a view using solely geometric transformations. We then describe a more general transformation that allows hierarchical, structured information about the graph to modify the views. Our general transformation is a fundamental extension to the previous research in fisheye views.


abstract:
We describe two applications that illustrate the idea of computational wear in the domain of document processing. By graphically depicting the history of author and reader interactions with documents, these applications offer otherwise unavailable information to guide work. We discuss how their design accords with a theory of professional work and an informational physics perspective on interface design.

keywords:
graphical user interfaces, informational physics, interface mechanisms, professional work, reflective practitioner


title:
The art of search: a study of art directors

abstract:
We formulated a model of visual search by conducting a work flow study and task analysis of art directors as they searched for images to use in an advertisement. The analysis revealed the presence of artistic and image concepts, flexible structures which guide the search and are molded by them. Analysis results were used to build a model-based interface for visual search. Results from presenting the interface to users indicate that the interface has the potential to make significant contributions to the visual search task, both in time savings and as an aid to the creative process.

keywords:
cognitive models, navigation, searching, task analysis, user interface models, user models, visual problem solving


title:
Value bars: an information visualization and navigation tool for multi-attribute listings


title:
An empirical study of multiple-view software development


title:
Dynamic queries for information exploration: an implementation and evaluation


title:
Structural analysis of hypertexts: identifying hierarchies and useful metrics

abstract:
Hypertext users often suffer from the "lost in hyperspace" problem: disorientation from too many jumps while traversing a complex network. One solution to this problem is improved authoring to create more comprehensible structures. This paper proposes several authoring tools, based on hypertext structure analysis. In many hypertext systems authors are encouraged to create hierarchical structures, but when writing, the hierarchy is lost because of the inclusion of cross-reference links. The first part of this paper looks at ways of recovering lost hierarchies and finding new ones, offering authors different views of the same hypertext. The second part helps authors by identifying properties of the hypertext document. Multiple metrics are developed including compactness and stratum . Compactness indicates the intrinsic connectedness of the hypertext, and stratum reveals to what degree the hypertext is organized so that some nodes must be read before others. Several existing hypertexts are used to illustrate the benefits of each technique. The collection of techniques provides a multifaceted view of the hypertext, which should allow authors to reduce undesired structural complexity and create documents that readers can traverse more easily.

keywords:
graph theory, hierarchies, hypertext, metrics, structural analysis


title:
Visualizing hyperbolic space: unusual uses of 4x4 matrices


title:
Numerical recipes in C (2nd ed.): the art of scientific computing


title:
Information visualization using 3D interactive animation


title:
Evaluating 3D task performance for fish tank virtual worlds

keywords:
head-coupled display, stereopsis, virtual reality, virtual worlds


title:
Development of a modern OPAC: from REVTOLC to MARIAN

abstract:
Since 1986 we have investigated the problems and possibilities of applying modern information retrieval methods to large online public access library catalogs (OPACs). In the Retrieval Experiment-Virginia Tech OnLine Catalog (REVTOLC) study we carried out a large pilot test in 1987 and a larger, controlled investigation in 1990, with 216 users and roughly 500,000 MARC records. Results indicated that a forms-based interface coupled with vector and relevance feedback retrieval methods would be well received. Recent efforts developing the Multiple Access and Retrieval of Information with Annotations (MARIAN) system have involved used of a specially developed object-oriented DBMS, construction of a client running under NeXTSTEP, programming of a distributed server with a thread assigned to each user session to increase concurrency on a small network of NeXTs, refinement of algorithms to use objects and stopping rules for greater efficiency, usability testing and iterative interface refinement.


title:
On the knowledge underlying multimedia presentations


title:
Discovering shared interests using graph analysis

keywords:
collaboration, directory service, dynamic organization, graph theory, interpersonal communications, resource directory, traffic analysis


title:
Visualization of message passing parallel programs with the TOPSYS parallel programming environment

keywords:
visualization of parallel programs, monitoring, distributed memory computers, communication and sychronization, debugging, integrated programming environment


title:
A methodology for building application-specific visualizations of parallel programs


title:
Pad: an alternative approach to the computer interface

abstract:
We believe that navigation in information spaces is best supported by tapping into our natural spatial and geographic ways of thinking. To this end, we are developing a new computer interface model called Pad. The ongoing Pad project uses a spatial metaphor for computer interface design. It provides an intuitive base for the support of such applications as electronic marketplaces, information services, and on-line collaboration. Pad is an infnite two dimensional information plane that is shared among users, much as a network fle system is shared. Objects are organized geographically; every object occupies a well defned region on the Pad surface.For navigation, Pad uses "portals" -- magnifying glasses that can peer into and roam over different parts of this single infinite shared desktop; links to specific items are established and broken continually as the portal's view changes. This paradigm enables the sort of peripheral activity generally found in real physical working environments. The apparent size of an object to any user determines the amount of detail it presents. Different users can share and view multiple applications while assigning each a desired degree of interaction. Documents can be visually nested and zoomed as they move back and forth between primary and secondary working attention. Things can be peripherally accessible. In this paper we describe the Pad interface. We discuss how to efficiently implement its graphical aspects, and we illustrate some of our initial applications.


title:
Toolglass and magic lenses: the see-through interface

keywords:
button, control panel, lens, macro, menu, multi-hand, transparent, viewing filter


title:
Animation: from cartoons to the user interface

keywords:
Self, animation, cartoons, motion blur, user interfaces


title:
Stretching the rubber sheet: a metaphor for viewing large layouts on small screens

keywords:
graphical visualization, information visualization, interactive systems, interface metaphors


title:
Algorithm animation using 3D interactive graphics

keywords:
3D graphics, algorithm animation, information visualization, program visualization


title:
Windows on the world: 2D windows for 3D augmented reality

keywords:
X11, augmented reality, head-mounted displays, hypertext/hypermedia, mobile computing, portable computers, virtual reality, virtual worlds, window systems


title:
A toolset for navigation in virtual environments

keywords:
cognitive maps, navigation, orientation, virtual worlds


title:
Media-based navigation for hypermedia systems

keywords:
hypermedia database, indexing, information retrieval, media-based navigation, pattern matching


title:
Exploring large hyperdocuments: fisheye views of nested networks

keywords:
fisheye views, graphs, navigation, nested hypertext networks, overviews


abstract:
Making sense of a body of data is a common activity in any kind of analysis. Sensemaking is the process of searching for a representation and encoding data in that representation to answer task-specific questions. Different operations during sensemaking require different cognitive and external resources. Representations are chosen and changed to reduce the cost of operations in an information processing task. The power of these representational shifts is generally under-appreciated as is the relation between sensemaking and information retrieval. We analyze sensemaking tasks and develop a model of the cost structure of sensemaking. We discuss implications for the integrated design of user interfaces, representational tools, and information retrieval systems.

keywords:
cost structure, information access, learning loop, representation search, representation shift, sensemaking


title:
The limits of expert performance using hierarchic marking menus

abstract:
A marking menu allows a user to perform a menu selection by either popping-up a radial (or pie) menu, or by making a straight mark in the direction of the desired menu item without popping-up the menu. A hierarchic marking menu uses hierarchic radial menus and "zig-zag" marks to select from the hierarchy. This paper experimentally investigates the bounds on how many items can be in each level, and how deep the hierarchy can be, before using a marking to select an item becomes too slow or prone to errors.

keywords:
accelerators, gestures, input devices, marking menus, pen based input, pie menus


title:
InfoCrystal: a visual tool for information retrieval & management

keywords:
graphical user interface, human factors, information retrieval, information visualization, visual query language


title:
A graphical query interface based on aggregation/generalization hierarchies


title:
A review and taxonomy of distortion-oriented presentation techniques

abstract:
One of the common problems associated with large computer-based information systems is the relatively small window through which an information space can be viewed. Increasing interest in recent years has been focused on the development of distortion-oriented presentation techniques to address this problem. However, the growing number of new terminologies and techniques developed have caused considerable confusion to the graphical user interface designer, consequently making the comparison of these presentation techniques and generalization of empirical results of experiments with them very difficult, if not impossible. This article provides a taxonomy of distortion-oriented techniques which demonstrates clearly their underlying relationships. A unified theory is presented to reveal their roots and origins. Issues relating to the implementation and performance of these techniques are also discussed.

keywords:
Perspective Wall, bifocal displays, distortion-oriented presentation, fisheye views, focus + context techniques, graphical interfaces, information visualization, presentation techniques


abstract:
A timeline is a linear, graphical visualization of events over time. For example, in concurrent application, events would represent state changes for some system object (such as a task or variable). A timeline display generator creates the graphical visualization from some record of events. This paper reports on a model for timeline display generators based on a formal model of event history and the objectives of timeline visualization. In this model, any timeline display generator is completely described through the definition of a set of mathematical functions. The exact characteristics and flexibility of a particular implementation of a timeline display generator, depends on the way in which these functions have been implemented. The current prototype, xtg, (Timeline Display Generator for X-windows) serves as an example implementation of these ideas. Characteristics of xtg are presented, and its use in the analysis of a real-world client-server application is discussed. Xtg has been applied to several other applications to-date and is being applied by several telecommunications companies to areas ranging from software process analysis to call trace data analysis.


title:
A high performance Interactive Image Spreadsheet (IISS)


title:
LyberWorld-a visualization user interface supporting fulltext retrieval


title:
Hypothesis-Driven Constructive Induction in AQ17-HCI: A Method and Experiments

abstract:
Traditional concept learning methods express the learned hypothesis using descriptors that are present in describing the training examples. In other words, they learn in the same representation space in which training examples are presented. For many practical problems this is a serious limitation, because concepts to be learned require descriptors that go beyond those originally provided. To attack such problems, a constructive induction approach splits the learning process into two intertwined searches: one-for the most appropriate representation space for the given learning problem, and second -for the best inductive hypothesis in the newly created space. A hypothesis-driven constructive induction method changes the concept representation spaces in the process of the concept learning. The changes involve expansion and contraction of the representation space, and are based on the analysis of consecutively created inductive hypotheses.

keywords:
Concept learning, constructive induction, decision lists, decision rules, decision trees, diagrammatic visualization


title:
Virtual images: interactive visualization of distributed object-oriented systems

abstract:
In spite of growing needs in many areas, there is a lack of powerful graphical interfaces for interacting with large and complex sets of objects. Debugging, management and monitoring tools for object-oriented distributed systems or databases, for instance, need new interfaces that allow high quality visualization and interaction. We propose to use 3D interactive animations for representing large numbers of objects, complex relationships, and dynamic execution of concurrent activities. These innovative graphical representations, that we call virtual images , provide a consistent and intuitive solution for integrating various functionalities, considerably increasing the amount of information processed by the user. This technique has been successfully applied without specific hardware, demonstrating the feasibility of such interfaces on non specialized workstations.


title:
Designing Workscape: an interdisciplinary experience

keywords:
documents, interdisciplinary, interdisciplinary Adobe Acrobat QuickTime Windows Media Player Real Player


title:
Using aggregation and dynamic queries for exploring large data sets

keywords:
data exploration, data visualization, graphics presentation, intelligent interfaces, interactive techniques, large data sets


keywords:
business charts, data visualization, demonstrational interfaces, interactive techniques


title:
Interactive graphic design using automatic presentation knowledge

keywords:
automatic presentation systems, data visualization, design environments, graphic design, intelligent interfaces, interactive techniques


title:
The movable filter as a user interface tool

keywords:
editing, graphics, lens, macro, transparent, viewing filter, visualization


title:
Visual information seeking: tight coupling of dynamic query filters with starfield displays

keywords:
database query, dynamic queries, information seeking, starfield displays, tight coupling


title:
The table lens: merging graphical and symbolic representations in an interactive focus + context visualization for tabular information

keywords:
exploratory data analysis, fisheye technique, focus+context technique, graphical representations, information visualization, relational tables, spreadsheets, tables


title:
Multitrees: enriching and reusing hierarchical structure

keywords:
directed graphs, graphical browsers, hierarchies, hypertext structures, information graphs, representation, reuse


keywords:
button, control panel, lens, macro, menu, multihand, transparent, user interface, viewing filter


title:
The alphaslider: a compact and rapid selector

keywords:
Alphaslider, dynamic queries, menus, selection technology, widget


abstract:
We describe a data visualization system based on spreadsheets. Cells in our spreadsheet contain graphical objects such as images, volumes, or movies. Cells may also contain widgets such as buttons, sliders, or curve editors. Objects are displayed in miniature inside each cell. Formulas for cells are written in a general-purpose programming language (Tcl) augmented with operators for array manipulation, image processing, and rendering. Compared to flow chart visualization systems, spreadsheets are more expressive, morescalable, and easier to program. Compared to conventional numerical spreadsheets, spreadsheets for images pose several unique design problems: larger formulas, longer computation times, and more complicated intercelldependencies. In response to these problems, we have extended the spreadsheet paradigm in three ways: formulas can display their results anywhere in the spreadsheet, cells can be selectively disabled, and multiple cells can be edited at once. We discuss these extensions and their implications, and we also point out some unexpected uses for our spreadsheets: as a visual database browser, as a graphical user interface builder, as a smart clipboard for the desktop, and as a presentation tool.

keywords:
data visualization, flow charts, spreadsheets, user interfaces, visual programming languages


title:
Data structures for dynamic queries: an analytical and experimental evaluation

abstract:
Dynamic Queries is a querying technique for doing range search on multi-key data sets. It is a direct manipulation mechanism where the query is formulated using graphical widgets and the results are displayed graphically preferably within 100 milliseconds. This paper evaluates four data structures, the multilist, the grid file, k-d tree and the quad tree used to organize data in high speed storage for dynamic queries. The effect of factors like size, distribution and dimensionality of data on the storage overhead and the speed of search is explored. Analytical models for estimating the storage and the search overheads are presented, and verified to be correct by empirical data. Results indicate that multilists are suitable for small (few thousand points) data sets irrespective of the data distribution. For large data sets the grid files are excellent for uniformly distributed data, and trees are good for skewed data distributions. There was no significant difference in performance between the tree structures.


title:
Automatic layout based on formal semantics

abstract:
The department Publication and Visualisation Environment (PaVE) at the Integrated Publication and Information Systems Institute (IPSI) is currently building a publishing environment for electronic reference works. As an example and in order to derive requirements for this publishing environment we are currently building an electronic prototype of the Dictionary of Art. The paper version will be published as a commercial product by Macmillan Publishers Ltd. in 1995. In addition to the extraction of facts from the texts of the Dictionary of Art and the representation of these facts in a network of information units (Object Network), one of the major tasks in building the prototype is the design of its end-user interface. Support will be provided for the end-user to retrieve facts from the object network. In order to provide an intuitive way of displaying and interacting with the query results, we intend to provide a graphical dialogue interface. The display of the query results requires the automatic visualisation of a portion of the object network. Automatic visualisation of query results is an important feature because it reflects the characteristics of individual data sets. We want to use automatic layout in the context of an interactive query-presentation process so that the diagrams not only serve to communicate information to the user, but also to allow him to specify further information requests based on presentation results. In this short paper we describe a knowledge-based automatic visualisation approach. The visualisation principle is to see the layout problem as an organisation process. Data regularities which can be described in terms of formal semantics as well as structural properties are the basic components for the construction of the data organisation. This organisation can be translated into the visual organisation of the final presentation.


title:
Galaxy of news: an approach to visualizing and understanding expansive news landscapes

abstract:
The Galaxy of News system embodies an approach to visualizing large quantities of independently authored pieces of information, in this case news stories. At the heart of this system is a powerful relationship construction engine that constructs an associative relation network to automatically build implicit links between related articles. To visualize these relationships, and hence the news information space, the Galaxy of News uses pyramidal structuring and visual presentation, semantic zooming and panning, animated visual cues that are dynamically constructed to illustrate relationships between articles, and fluid interaction in a three dimensional information space to browse and search through large databases of news articles. The result is a tool that allows people to quickly gain a broad understanding of a news base by providing an abstracted presentation that covers the entire information base, and through interaction, progressively refines the details of the information space. This research has been generalized into a model for news access and visualization to provide automatic construction of news information spaces and derivation of an interactive news experience.

keywords:
3D interactive graphics, abstracted information spaces, information interaction design, information space design, information visualization, pyramidal information structures


title:
Laying out and visualizing large trees using a hyperbolic space

abstract:
We present a new focus+context (fisheye) scheme for visualizing and manipulating large hierarchies. The essence of our approach is to lay out the hierarchy uniformly on the hyperbolic plane and map this plane onto a circular display region. The projection onto the disk provides a natural mechanism for assigning more space to a portion of the hierarchy while still embedding it in a much larger context. Change of focus is accomplished by translating the structure on the hyperbolic plane, which allows a smooth transition without compromising the presentation of the context.

keywords:
fisheye display, focus+context technique, hierarchy display, information visualization


title:
Powers of ten thousand: navigating in large information spaces

abstract:
How would you interactively browse a very large display space, for example, a street map of the entire United States? The traditional solution is zoom and pan . But each time a zoom-in operation takes place, the context from which it came is visually lost. Sequential applications of the zoom-in and zoom-out operations may become tedious. This paper proposes an alternative technique, the macroscope , based on zooming and planning in multiple translucent layers. A macroscope display should comfortably permit browsing continuously on a single image, or set of images in multiple resolutions, on a scale of at least 1 to 10,000.


title:
Pad++: a zooming graphical interface for exploring alternate interface physics

abstract:
We describe the current status of Pad++, a zooming graphical interface that we are exploring as an alternative to traditional window and icon-based approaches to interface design. We discuss the motivation for Pad++, describe the implementation, and present prototype applications. In addition, we introduce an informational physics strategy for interface design and briefly compare it with metaphor-based design strategies.

keywords:
authoring, hypertext, information navigation, information physics, information visualization, interactive user interfaces, multiscale interfaces, zooming interfaces


title:
Reconnaissance support for juggling multiple processing options

abstract:
A large proportion of computer-supported tasks-such as design exploration, decision analysis, data presentation, and many kinds of retrieval-can be characterised as user-driven processing of a body of data in search of an outcome that satisfies the user . Clearly such tasks can never be automated fully, but few existing tools offer support for mechanising more than the simplest repetitive aspects of the search. Reconnaissance facilities, in which the computer produces summary reports from exploration in directions suggested by the user, can save the user time and effort by revealing which areas are the most deserving of detailed investigation. The time users are prepared to spend on searching will be more effectively used, improving the likelihood of finding solutions that really meet their needs rather than merely being the first to appear satisfactory. This note describes an implemented example of reconnaissance, based on the parallel coordinates presentation technique.

keywords:
data visualisation, direct manipulation, dynamic query, graphical user interfaces, interaction techniques, visual programming


title:
An architecture for an extensible 3D interface toolkit

abstract:
This paper presents the architecture for an extensible toolkit used in construction and rapid prototyping of three dimensional interfaces, interactive illustrations, and three dimensional widgets. The toolkit provides methods for the direct manipulation of 3D primitives which can be linked together through a visual programming language to create complex constrained behavior. Features of the toolkit include the ability to visually build, encapsulate, and parameterize complex models, and impose limits on the models. The toolkit's constraint resolution technique is based on a dynamic object model similar to those in prototype delegation object systems. The toolkit has been used to rapidly prototype tools for mechanical modelling, scientific visualization, construct 3D widgets, and build mathematical illustrations.

keywords:
constraints, delegation, direct manipulation, interaction techniques, user interface toolkits, visual programming


title:
3D widgets for exploratory scientific visualization

abstract:
Scientists use a variety of visualization techniques to help understand computational fluid dynamics (CFD) datasets, but the interfaces to these techniques are generally two-dimensional and therefore are separated from the 3D view. Both rapid interactive exploration of datasets and precise control over the parameters and placement of visualization techniques are required to understand complex phenomena contained in these datasets. In this paper, we present work in progress on a 3D user interface for exploratory visualization of these datasets.

keywords:
3D user interface, scientific visualization


title:
Developing calendar visualizers for the information visualizer

abstract:
The increasing mass of information confronting a business or an individual have created a demand for information management applications. Time-based information, in particular, is an important part of many information access tasks. This paper explores how to use 3D graphics and interactive animation to design and implement visualizers that improve access to large masses of time-based information. Two new visualizers have been developed for the Information Visualizer: 1) the Spiral Calendar was designed for rapid access to an individual's daily schedule, and 2) the Time Lattice was designed for analyzing the time relationships among the schedules of groups of people. The Spiral Calendar embodies a new 3D graphics technique for integrating detail and context by placing objects in a 3D spiral. It demonstrates that advanced graphics techniques can enhance routine office information tasks. The Time Lattice is formed by aligning a collection of 2D calendars. 2D translucent shadows provide views and interactive access to the resulting complex 3D object. The paper focuses on how these visualizations were developed. The Spiral Calendar, in particular, has gone through an entire cycle of development, including design, implementation, evaluation, revision and reuse. Our experience should prove useful to others developing user interfaces based on advanced graphics.

keywords:
3D graphics, calendars, detail+context technique, graphical representations, information retrieval, information visualization, interactive animation, translucent shadows


abstract:
Computer sliders are a generic user input mechanism for specifying a numeric value from a range. For data visualization, the effectiveness of sliders may be increased by using the space inside the slider as . an interactive color scale, . a barplot for discrete data, and . a density plot for continuous data. The idea is to show the selected values in relation to the data and its distribution. Furthermore, the selection mechanism may be generalized using a painting metaphor to specify arbitrary, disconnected intervals while maintaining an intuitive user-interface.

keywords:
dynamic graphics, high interaction, information visualization, selection, thresholding


title:
An Editor's Workbench for an art history reference work

abstract:
The architecture and some of the realized functionality of a prototype Editor's Workbench that supports the creation and maintenance of an object-oriented publisher's knowledge base is presented. The knowledge base is the repository not only for the actual publication content, but for all the information needed to manage and control the publication process. The concrete application context is an art history reference work. We discuss content acquisition and data modelling aspects of the underlying object network.

keywords:
Editor's Workbench, hypermedia reference work, knowledge-based system, object-oriented data modelling


title:
A classification of visual representations


abstract:
Effective information access involves rich interactions between users and information residing in diverse locations. Users seek and retrieve information from the sources-for example, file serves, databases, and digital libraries-and use various tools to browse, manipulate, reuse, and generally process the information. We have developed a number of techniques that support various aspects of the process of user/information interaction. These techniques can be considered attempts to increase the bandwidth and quality of the interactions between users and information in an information workspace -an environment designed to support information work (see Figure 1).


title:
RMM: a methodology for structured hypermedia design

abstract:
Hypermedia projects differ from traditional software development projects in several critical dimensions. First, as Streitz notes in this issue, hypermedia projects may involve people with very different skill sets: authors, librarians, content designers, artists, and musicians, as well as programmers. Second, the design of hypermedia applications involves capturing and organizing the structure of a complex domain and making it clear and accessible to users [9]. Third, multimedia aspects of hypermedia applications raise numerous difficulties [13]. Hypermedia design is therefore a challenging process that is currently more of an art than a science. Finally, the need for prototyping (see Nanard and Nanard in this issue) and intensive testing with users is even more pronounced in hypermedia development than it is with traditional software, because user tolerance to errors in hypermedia applications is very low. In this article we propose the Relationship Management Methodology (RMM) for the design and construction of hypermedia applications. The name "relationship management" stems from our view of hypermedia as a vehicle for managing relationships among information objects.


title:
An empirical study of algorithms for point-feature label placement

abstract:
A major factor affecting the clarity of graphical displays that include text labels is the degree to which labels obscure display features (including other labels) as a result of spatial overlap. Point-feature label placement (PFLP) is the problem of placing text labels adjacent to point features on a map or diagram so as to maximize legibility. This problem occurs frequently in the production of many types of informational graphics, though it arises most often in automated cartography. In this paper we present a comprehensive treatment of the PFLP problem, viewed as a type of combinatorial optimization problem. Complexity analysis reveals that the basic PFLP problem and most interesting variants of it are NP-hard. These negative results help inform a survey of previously reported algorithms for PFLP; not surprisingly, all such algorithms either have exponential time complexity or are incomplete. To solve the PFLP problem in practice, then, we must rely on good heuristic methods. We propose two new methods, one based on a discrete form of gradient descent, the other on simulated annealing, and report on a series of empirical tests comparing these and the other known algorithms for the problem. Based on this study, the first to be conducted, we identify the best approaches as a function of available computation time.

keywords:
automated cartography, heuristic search, label placement, simulated annealing, stochastic methods


title:
Machine learning, neural and statistical classification


title:
Distributed snapshots: determining global states of distributed systems

abstract:
This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to solve an important class of problems: stable property detection. A stable property is one that persists: once a stable property becomes true it remains true thereafter. Examples of stable properties are "computation has terminated," " the system is deadlocked" and "all tokens in a token ring have disappeared." The stable property detection problem is that of devising algorithms to detect a given stable property. Global state detection can also be used for checkpointing.

keywords:
Global States, Distributed deadlock detection, distributed systems, message communication systems


title:
Directness and liveness in the morphic user interface construction environment

keywords:
animation, automatic layout, direct manipulation, directness, live editing, liveness, structural reification, user interface construction, user interface frameworks


title:
SDM: selective dynamic manipulation of visualizations

keywords:
direct manipulation, interactive techniques, visualizations


title:
The continuous zoom: a constrained fisheye technique for viewing and navigating large information spaces

keywords:
fisheye view, graphical user interface, hierarchical network, information space, information visualization, navigation, supervisory control systems


title:
3-dimensional pliable surfaces: for the effective presentation of visual information

keywords:
3D interactions, distortion viewing, information visualization, interface design issues, interface metaphors, screen layout


title:
Visualizing the structure of the World Wide Web in 3D hyperbolic space


title:
Visualizing real-time multivariate data using preattentive processing

abstract:
A new method is presented for visualizing data as they are generated from real-time applications. These techniques allow viewers to perform simple data analysis tasks such as detection of data groups and boundaries, target detection, and estimation. The goal is to do this rapidly and accurately on a dynamic sequence of data frames. Our techniques take advantage of an ability of the human visual system called preattentive processing. Preattentive processing refers to an initial organization of the visual system based on operations believed to be rapid, automatic, and spatially parallel. Examples of visual features that can be detected in this way include hue, orientation, intensity, size, curvature, and line length. We believe that studies from preattentive processing should be used to assist in the design of visualization tools, especially those for which high speed target, boundary, and region detection are important. Previous work has shown that results from research in preattentive processing can be used to build visualization tools that allow rapid and accurate analysis of individual, static data frames. We extend these techniques to a dynamic real-time environment. This allows users to perform similar tasks on dynamic sequences of frames, exactly like those generated by real-time systems such as visual interactive simulation. We studied two known preattentive features, hue and curvature. The primary question investigated was whether rapid and accurate target and boundary detection in dynamic sequences is possible using these features. Behavioral experiments were run that simulated displays from our preattentive visualization tools. Analysis of the results of the experiments showed that rapid and accurate target and boundary detection is possible with both hue and curvature. A second question, whether interactions occur between the two features in a real-time environment, was answered positively.

keywords:
boundary detection, cognitive psychology, curvature, hue, human vision, icon, multivariate data, preattentive, scientific visualization, target detection, visual interactive simulation


title:
Interactive physically-based manipulation of discrete/continuous models

keywords:
grammars, interactive techniques, physically-based modeling


keywords:
content-based retrieval, image databases, image indexing, image metrics, query by content, query by example, similarity retrieval, sketch retrieval, wavelets


title:
IVEE: an environment for automatic creation of dynamic queries applications

keywords:
database query, dynamic queries, information exploration, information visualization, tight coupling


title:
Pad++: a zoomable graphical interface system

keywords:
authoring, hypertext, information navigation, information visualization, interactive interfaces, multimedia, multiscale interfaces, navigation, world wide web, zooming


abstract:
In many contexts, humans often represent their own "neighborhood" in great detail, yet only major landmarks further away. This suggests that such views ("fisheye views") might be useful for the computer display of large information structures like programs, data bases, online text, etc. This paper explores fisheye views presenting, in turn, naturalistic studies, a general formalism, a specific instantiation, a resulting computer program, example displays and an evaluation.


title:
Exploring large tables with the table lens

keywords:
Information Visualization, Exploratory Data Analysis, Graphical Representations, Focus+context Technique, Fisheye Technique, Tables, Spreadsheets, Relational


title:
LyberWorld: a 3D graphical user interface for fulltext retrieval


title:
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets

abstract:
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [25]. Thus, we can subsequently use highly fine-tuned spatial access methods (SAMS), to answer several types of queries, including the 'Query By Example' type (which translates to a range query); the 'all pairs' query (which translates to a spatial join [8]); the nearest-neighbor or best-match query, etc. However, designing feature extraction functions can be hard. It is relatively easier for a domain expert to assess the similarity/distance of two objects. Given only the distance information though, it is not obvious how to map objects into points. This is exactly the topic of this paper. We describe a fast algorithm to map objects into points in some k-dimensional space (k is user-defined), such that the dis-similarit ies are preserved. There are two benefits from this mapping: (a) efficient ret rieval, in conjunction with a SAM, as discussed before and (b) visualization and data-mining: the objects can now be plotted as points in 2-d or 3-d space, revealing pot ential clusters, correlations among attributes and other regularities that data-mining is looklng for. We introduce an older method from pattern recognition, namely, Multi-Dimensional Scaling (MDS) [51]; although unsuitable for indexing, we use it as yardstick for our method. Then, we propose a much faster algorithm to solve the problem in hand, while in addition it allows for indexing. Experiments on real and synthetic data indeed show that the proposed algorithm is significantly faster than MDS, (being linear, as opposed to quadratic, on the database size N), while it manages to preserve distances and the overall structure of the data-set.


title:
VisDB: a system for visualizing large databases


title:
Information foraging in information access environments

keywords:
Information foraging theory, information access


title:
TileBars: visualization of term distribution information in full text information access


title:
Space-scale diagrams: understanding multiscale interfaces

keywords:
Zoom views, multiscale interfaces, fisheye views, information visualization, GIS; visualization, user interface components; formal methods, design rationale.


title:
Visualizing complex hypermedia networks through multiple hierarchical views

keywords:
Hypermedia, Overview Diagrams, Information Visualization, Hierarchization


title:
A focus+context technique based on hyperbolic geometry for visualizing large hierarchies

keywords:
Hierarchy Display, Information Visualization, Fisheye Display, Focus+Context Technique


title:
GeoSpace: an interactive visualization system for exploring complex information spaces

keywords:
Interactive techniques, intelligent interfaces, cartography, multi-layer, graphics presentation, activation spreading network


title:
Enhanced dynamic queries via movable filters

keywords:
viewing filter, lens, database query, dynamic queries, magic lens, visualization


abstract:
The monitoring of distributed systems involves the collection, interpretation, and display of information concerning the interactions among concurrently executing processes. This information and its display can support the debugging, testing, performance evaluation, and dynamic documentation of distributed systems. General problems associated with monitoring are outlined in this paper, and the architecture of a general purpose, extensible, distributed monitoring system is presented. Three approaches to the display of process interactions are described: textual traces, animated graphical traces, and a combination of aspects of the textual and graphical approaches. The roles that each of these approaches fulfill in monitoring and debugging distributed systems are identified and compared. Monitoring tools for collecting communication statistics, detecting deadlock, controlling the non-deterministic execution of distributed systems, and for using protocol specifications in monitoring are also described. Our discussion is based on experience in the development and use of a monitoring system within a distributed programming environment called Jade. Jade was developed within the Computer Science Department of the University of Calgary and is now being used to support teaching and research at a number of university and research organizations.

keywords:
Concurrent monitoring, distributed monitoring, dynamic documentation, graphical monitoring


title:
Simplifying data integration: the design of the desert software development environment

keywords:
Desert environment, Desert software development environment, FrameMaker, ToolTalk interface, common editor, context manager, control integration, data integration, fragments, hyperlinks, programming environments, programming tools, software engineering, software tools, virtual files


title:
Automating the design of graphical presentations of relational information

abstract:
The goal of the research described in this paper is to develop an application-independent presentation tool that automatically designs effective graphical presentations (such as bar charts, scatter plots, and connected graphs) of relational information. Two problems are raised by this goal: The codification of graphic design criteria in a form that can be used by the presentation tool, and the generation of a wide variety of designs so that the presentation tool can accommodate a wide variety of information. The approach described in this paper is based on the view that graphical presentations are sentences of graphical languages. The graphic design issues are codified as expressiveness and effectiveness criteria for graphical languages. Expressiveness criteria determine whether a graphical language can express the desired information. Effectiveness criteria determine whether a graphical language exploits the capabilities of the output medium and the human visual system. A wide variety of designs can be systematically generated by using a composition algebra that composes a small set of primitive graphical languages. Artificial intelligence techniques are used to implement a prototype presentation tool called APT (A Presentation Tool), which is based on the composition algebra and the graphic design criteria.

keywords:
Automatic generation, composition algebra, effectiveness, expressiveness, graphic design, information presentation, presentation tool, user interface


title:
High-speed visual estimation using preattentive processing

abstract:
A new method is presented for performing rapid and accurate numerical estimation. The method is derived from an area of human cognitive psychology called preattentive processing. Preattentive processing refers to an initial organization of the visual field based on cognitive operations believed to be rapid, automatic, and spatially parallel. Examples of visual features that can be detected in this way include hue, intensity, orientation, size, and motion. We beleive that studies from preattentive vision should be used to assist in the design of visualization tools, especially those for which high-speed target detection, boundary identification, and region detection are important. In our present study, we investigated two known preattentive features (hue and orientation) in the context of a new task (numerical estimation) in order to see whether preattentive estimation was possible. Our experiments tested displays that were designed to visualize data from salmon migration simulations. The results showed that rapid and accurate estimation was indeed possible using either hue or orientation. Furthermore, random variation in one of these features resulted in no interference when subjects estimated the percentage of the other. To test the generality of our results, we varied two important display parameters-display duration and feature difference-and found boundary conditions for each. Implications of our results for application to real-world data and tasks are discussed.

keywords:
Munsell, boundary detection, cognitive psychology, color, estimation, human vision, icon, multidimensional data, orientation, preattentive, scientific visualization, target detection


title:
Navigating hierarchically clustered networks through fisheye and full-zoom methods

abstract:
Many information structures are represented as two-dimensional networks (connected graphs) of links and nodes. Because these network tend to be large and quite complex, people often perfer to view part or all of the network at varying levels of detail. Hierarchical clustering provides a framework for viewing the network at different levels of detail by superimposing a hierarchy on it. Nodes are grouped into clusters, and clusters are themselves place into other clusters. Users can then navigate these clusters until an appropiate level of detail is reached. This article describes an experiment comparing two methods for viewing hierarchically clustered networks. Traditional full-zoom techniques provide details of only the current level of the hierarchy. In contrast, fisheye views, generated by the "variable-zoom" algorithm described in this article, provide information about higher levels as well. Subjects using both viewing methods were given problem-solving tasks requiring them to navigate a network, in this case, a simulated telephone system, and to reroute links in it. Results suggest that the greater context provided by fisheye views significantly improved user performance. Users were quicker to complete their task and made fewer unnecessary navigational steps through the hierarchy. This validation of fisheye views in important for designers of interfaces to complicated monitoring systems, such as control rooms for supervisory control and data acquistion systems, where efficient human performance is often critical. However, control room operators remained concerned about the size and visibility tradeoffs between the fine room operators remained concerned about the size and visibility tradeoffs between the fine detail provided by full-zoom techniques and the global context supplied by fisheye views. Specific interface feaures are required to reconcile the differences.

keywords:
data acquisition, fisheye views, hierarchically clustered graphs, information visualization, supervisory control


title:
IDEA: interactive data exploration and analysis


title:
BIRCH: an efficient data clustering method for very large databases


title:
Drawing graphs nicely using simulated annealing

abstract:
The paradigm of simulated annealing is applied to the problem of drawing graphs "nicely." Our algorithm deals with general undirected graphs with straight-line edges, and employs several simple criteria for the aesthetic quality of the result. The algorithm is flexible, in that the relative weights of the criteria can be changed. For graphs of modest size it produces good results, competitive with those produced by other methods, notably, the "spring method" and its variants.

keywords:
aesthetics, graph drawing, simulated annealing


title:
Adding imageability features to information displays

keywords:
imageability, information design, navigation, visualization


title:
FOCUS: the interactive table for product comparison and selection

keywords:
dynamic queries, focus+context technique, interactive data exploration, spreadsheets, tables


title:
The sciences of the artificial (3rd ed.)


title:
Does animation in user interfaces improve decision making?


title:
The WebBook and the Web Forager: an information workspace for the World-Wide Web

keywords:
3D graphics, World Wide Web, information access, information workspace, user interfaces, workspace


title:
Silk from a sow's ear: extracting usable structures from the Web

keywords:
World Wide Web, hypertext, information visualization


title:
Scatter/gather browsing communicates the topic structure of a very large text collection

keywords:
Scatter/Gather, browsing, clustering, information retrieval


keywords:
history, justice, medical record, overview, personal record, screen design, screen management, timeline, visualization


keywords:
amulet, command objects, redo, toolkits, undo, user interface development environment


title:
Extending end-user programming in a visual shell with programming by demonstration and graphical language techniques


keywords:
Supervised learning, reinforcement learning, temporal-difference learning, cognitive architectures


title:
Visualizing search results: some alternatives to query-document similarity


title:
Evaluation of a tool for visualization of information retrieval results


title:
Cheops: a compact explorer for complex hierarchies

keywords:
focus+context techniques, graphical browser, hierarchical representation, information visualization and exploration


title:
The design and implementation of an object-oriented toolkit for 3D graphics and visualization


title:
Visualization of complex models using dynamic texture-based simplification

keywords:
geometry, interactive, morphing, simplification, space partitioning, textures, visibility culling, visual complexity


title:
A linear iteration time layout algorithm for visualising high-dimensional data

keywords:
force-directed placement, high-dimensional data, layout algorithms, spring models, stochastic algorithms, visualization


title:
Flexible information visualization of multivariate data from biological sequence similarity searches

keywords:
applications of visualization, biomedical visualization, information visualization, multimodal and multidimensional visualization


title:
Illustrating transparent surfaces with curvature-directed strokes

abstract:
Transparency can bc a useful device for simultaneously depicting multiple superimposed layers of information in a single image. However, in computer-generated pictures - as in photographs and in directly viewed actual objects - it can often be difficult to adequately perceive the three-dimensional shape of a layered transparent surface or its relative depth distance from underlying structures. Inspired by artists' use of line to show shape, we have explored methods for automatically defining a distributed set of opaque surface markings that intend to portray the three-dimensional shape and relative depth of a smoothly curving layered transparent surface in an intuitively meaningful (and minimally occluding) way. This paper describes the perceptual motivation, artistic inspiration and practical implementation of an algorithm for "texturing" a transparent surface with uniformly distributed opaque short strokes, locally oriented in the direction of greatest normal curvature, and of length proportional to the magnitude of the surface curvature in the stroke direction. The driving application for this work is the visualization of layered surfaces in radiation therapy treatment planning data, and the technique is illustrated on transparent isointensity surfaces of radiation dose.


title:
UFLOW: visualizing uncertainty in fluid flow

keywords:
animation, flow envelopes, flow visualization, rakes, streamlines, uncertainty glyphs


title:
Choosing effective colours for data visualization


abstract:
Dynamic queries constitute a very powerful mechanism for information visualization; some universe of data is visualized, and this visualization is modified on-the-fly as users modify the range of interest within the domains of the various attributes of the visualized information. In this paper, we analyze dynamic queries and offer some natural generalizations of the original concept by establishing a connection to SQL. We also discuss some implementation ideas that should make these generalizations efficient as well.


title:
Incremental data structures and algorithms for dynamic query interfaces

abstract:
Dynamic query interfaces (DQIs) form a recently developed method of database access that provides continuous realtime feedback to the user during the query formulation process. Previous work shows that DQIs are elegant and powerful interfaces to small databases. Unfortunately, when applied to large databases, previous DQI algorithms slow to a crawl. We present a new approach to DQI algorithms that works well with large databases.

keywords:
algorithm, data structure, database, direct manipulation, dynamic query, information visualization, user interface


title:
DEVise: integrated querying and visual exploration of large datasets

abstract:
DEVise is a data exploration system that allows users to easily develop, browse, and share visual presentation of large tabular datasets (possibly containing or referencing multimedia objects) from several sources. The DEVise framework is being implemented in a tool that has been already successfully applied to a variety of real applications by a number of user groups. Our emphasis is on developing an intuitive yet powerful set of querying and visualization primitives that can be easily combined to develop a rich set of visual presentations that integrate data from a wide range of application domains. While DEVise is a powerful visualization tool, its greatest strengths are the ability to interactively explore a visual presentation of the data at any level of detail (including retrieving individual data records), and the ability to seamlessly query and combine data from a variety of local and remote sources. In this paper, we present the DEVise framework, describe the current tool, and report on our experience in applying it to several real applications.


title:
MaPS: movement and planning support for navigation in an immersive VRML browser

keywords:
VRML2, first-class user interface, immersive browser, navigation techniques, user interface metaphors


title:
Interface issues and interaction strategies for information retrieval systems

keywords:
databases, information retrieval, information systems, interaction strategies, user interfaces


title:
Dynamic timelines: visualizing the history of photography

keywords:
cinema, interaction design, three-dimensional visualization, visual design


keywords:
Mosaic, World-Wide Web, information navigation, interaction techniques, interactive user interfaces


title:
Applying algorithm animation techniques for program tracing, debugging, and understanding


title:
Advances in knowledge discovery and data mining


title:
Cat-a-Cone: an interactive interface for specifying searches and viewing retrieval results using a large category hierarchy


title:
Using semantic contents and WordNet in image retrieval


keywords:
Web, agents, autonomous agents, browsing, interface agents, learning, search


title:
Illustrating surface shape in volume data via principal direction-driven 3D line integral convolution

keywords:
isosurfaces, line integral convolution, principal directions, shape representation, solid texture, stroke textures, transparent surfaces, visualization, volume rendering


title:
KidPad: a design collaboration between children, technologists, and educators

keywords:
KidPad, Pad++, children, cooperative design, design techniques, educational applications, evaluation, participatory design, social issues


title:
Visual information seeking using the FilmFinder

keywords:
Information Retrieval, Dynamic queries, Video-On-Demand


abstract:
The introduction of templates to C++ added a facility whereby the compiler can act as an interpreter. This makes it possible to write programs in a subset of C++ which are interpreted at compile time. Language features such as for loops and if statements can be replaced by template specialization and recursion. The first examples of these techniques were written by Erwin Unruh and circulated among members of the ANSI/ISO C++ standardization committee. These programs didn't have to be excecuted--they generated their output at compile time as warning messages. Fore example, one program generated warning messages containing prime numbers when compiled. Although this technique might seem just like a cute C++ trick, it becomes powerful when combined with normal C++ code. In this hybrid approach, source code contains two programs: the normal C++ run-time program, and a template metaprogram which runs at compile time. Template metaprograms can generate useful code when interpreted by the compiler, such as a massively inlined algorithm -- that is, an implementation of an algorithm which works for a specific input size, and has its loops unrolled. This results in large speed increases for many applications.


title:
Modelling and visualizing multiple spatial uncertainties

keywords:
GIS, fuzzy, slope stability modelling, uncertainty, visualization


title:
An interactive visual query environment for exploring data

keywords:
Direct manipulation, queries, information visualization, visual query language


title:
Drawing graphs to convey proximity: an incremental arrangement method

abstract:
Graph drawings are increasingly finding their way into user interfaces to convey a variety of relationships. This article deals with rendering graphs to show proximity between vertices by making their configuration (screen) distances reflect their distances in the graph. An arrangement method is described that achieves good drawings at speeds suitable for user interaction on a desktop computer. The method is "incremental" in that it first arranges a small portion of the graph, then arranges successively larger fractions of the graph until a suitable arrangement for the entirety is achieved. The incremental approach not only offers speed improvements, but avoids many of the suboptimal solutions reached with other iterative approaches. Algorithms are described in pseudocode, and results are presented.

keywords:
MDS, force-directed, graph drawing, graph layout, multidimensional scaling


title:
Navigation and coordination primitives for multidimensional visual browsers

keywords:
data browsing, hypermedia, magnifying glasses, user interfaces, visual databases, visual programming, wormholes, zooming


title:
Sketching, searching, and customizing visualizations: a content-based approach to design retrieval


title:
Constrained 3D navigation with 2D controllers

keywords:
camera control, constrained navigation, navigation, viewing control


title:
GADGET: goal-oriented application design guidance for modular visualization environments

abstract:
Modular Visualization Environments (MVEs) have recently been regarded as the de facto standard for scientific data visualization, mainly due to adoption of visual programming style, reusability, and extendability. However, since scientists and engineers as the MVE principal user are not always familar with how to map numerical data to proper graphical primitives, the set of built-in modules is not fully used to construct necessary applications networks Therefore, a certain mechanism needs to be incorporated into MVEs, which makes use of heuristics and expertise of visualization specialists (visineers), and which support the user in designing his/her applications with MVEs. The Wehrend's goal-oriented taxonomy of visualization techniques is adopted as the basic philosophy to develop a system, called GADGET, for application design guidance for MVEs. The GADGET system interactively helps the user design appropriate applications according to the sepcific visualization goals, temporal efficiency versus accuracy requirements, and such properties as dimension and mesh type of a given target dataset. Also, the GADGET system is capable of assisting the user in customizing a prototype modular network for his/her desired applications by showing execution examples involving datasets of the same type. This paper provides an overview of the GADGET guidance mechanism and system architecture, with an emphasis on its knowledge base design. Sample data visualization problems are used to demonstrate the usefulness of the GADGET system

keywords:
Modular Visualization Environments, dataflow paradigm, knowledge base, object-oriented design, taxonomy of visualization techniques, visineers' heuristics and expertise, visualization systems


title:
Visualization of geometric algorithms in an electronic classroom

keywords:
algorithm animation, geometric algorithms, visulaization in education


title:
The visualization toolkit (2nd ed.): an object-oriented approach to 3D graphics


title:
Clumping properties of content-bearing words


keywords:
Information visualization, visualization, World Wide Web, WWW, interaction, perception, usability


title:
Visual task characterization for automated visual discourse synthesis

keywords:
automated design of graphics, visual discourse, visual task characterization


title:
Visualizing the evolution of Web ecologies

abstract:
Several isualizations have emerged which attempt to visualize all or part of the World Wide Web. Those visualizations, however, fail to present the dynamically changing ecology of users and documents on the Web. We present new techniques for Web Ecology and Evolution Visualization (WEEV). Disk Trees represent a discrete time slice of the Web ecology. A collection of Disk Trees form a Time Tube, representing the evolution of the Web over longer periods of time. These visualizations are intended to aid authors and webmasters with the production and organization of content, assist Web surfers making sense of information, and help researchers understand the Web.

keywords:
World Wide Web, documents, hypertext, information ecologies, log file analysis, temporal analysis, visualizaiton


title:
DIVA: exploratory data analysis with multimedia streams

abstract:
DIVA supports exploratory data analysis of multimedia streams, enabling users to visualize, explore, and evaluate patterns in data that change over time. The underlying stream algebra provides the mathematical basis for operating on diverse kinds of streams. The streamer visualization technique provides a smooth transition between spatial and temporal views of the data. Mapping source and presentation streams into a two-dimensional space provides users with a direct manipulation, non-temporal interface for viewing and editing streams. DIVA was developed to help us analyze both qualitative and quantitative data collected in our research with French air traffic controllers, including video of controllers at work, audio records of telephone, radio, and other conversations, output from tools such as RADAR, and coded logs based on our observations. Although our emphasis is on exploratory data analysis, DIVA's streams architecture should prove useful for a wide variety of multimedia appliations.

keywords:
exploratory data analysis, hypermedia, multimedia, protocol analysis, stream algebra, streams, video


title:
A flexible architecture for user-adaptable visualization

abstract:
When information visualization is being used to support multiple users, two characteristics are important. First, multiple users with different backgrounds have individual information needs and thus require multiple views on the information. Second, to allow users to experiment with the information and the visualization, the visualization must be adaptable. This paper presents a conceptual framework which decouples the generation and presentation of information by means of an intermediate derived model, allowing users to adapt the visualization to their information needs. Additionall, we will discuss a Web-based software architecture which deploys CORBA to allow for dynamic and interactive visualizations

keywords:
information visualization, software architecture, user-interaction


title:
Visualizing document authorship using n-grams and latent semantic indexing

abstract:
An approach to visualizing authorship and writing style of free-form text documents is described. This approach uses n-grams and latent semantic indexing (LSI) to cluster documents according to usage patterns of related n-gram "terms". Latent semantic indexing distributes documents and terms into a relatively low=dimensional space, which can be viewed grpahically using various visualization techniques.

keywords:
clustering, indexing methods, information filtering, linguistic processing


title:
Effective visualization of hierarchical graphs with the cityscape metaphor

abstract:
In this paper, we describe an implementation of the cityscape metaphor to visualize trees. The cityscape metaphor is a generalization of barcharts in 3D. Our approach serves for better exploitation of human perception capabilities. To achieve this we employ effective visual cues like node position and size. We determine node positions in terms of perceptual organization. Further, we determine node sites for providing redundant hierarchical information. Redundancy aides in better understanding the tree structure. Finally, we point out some of the advantages of this approach to other spatial metaphors such as cone trees.

keywords:
image generation, display algorithms, computational geometry, objective modeling, methodology, 3D graphs, 3D realism


title:
A specification language for direct-manipulation user interfaces

abstract:
A direct-manipulation user interface presents a set of visual representations on a display and a repertoire of manipulations that can be performed on any of them. Such representations might include screen buttons, scroll bars, spreadsheet cells, or flowchart boxes. Interaction techniques of this kind were first seen in interactive graphics systems; they are now proving effective in user interfaces for applications that are not inherently graphical. Although they are often easy to learn and use, these interfaces are also typically difficult to specify and program clearly. Examination of direct-manipulation interfaces reveals that they have a coroutine-like structure and, despite their surface appearance, a peculiar, highly moded dialogue. This paper introduces a specification technique for direct-manipulation interfaces based on these observations. In it, each locus of dialogue is described as a separate object with a single-thread state diagram, which can be suspended and resumed, but retains state. The objects are then combined to define the overall user interface as a set of coroutines, rather than inappropriately as a single highly regular state transition diagram. An inheritance mechanism for the interaction objects is provided to avoid repetitiveness in the specifications. A prototype implementation of a user-interface management system based on this approach is described, and example specifications are given.

keywords:
user interfaces, specification techniques, specification language, human factors, direct manipulation, state transition diagram, user-interface management system (UIMS)


abstract:
Database visualization is an area of growing importance as database systems become larger and more accessible. DataSplash is an easy-to-use, integrated environment for navigating, creating, and querying visual representations of data. We will demonstrate the three main components which make up the DataSplash environment: a navigation system, a direct-manipulation interface for creating and modifying visualizations, and a direct-manipulation visual query system.

keywords:
database visualization, direct-manipulation, visual programming


title:
Graphical multiscale Web histories: a study of padprints

abstract:
We have implemented a browser companion called PadPrints that dynamically builds a graphical history-map of visited web pages. PadPrints relies on Pad++, a zooming user interface (ZUI) development substrate, to display the history-map using minimal screen space. We performed two usability studies of PadPrints. The first addressed general navigation effectiveness. The second focused on history-related aspects of navigation. In tasks requiring returns to prior pages, user of PadPrints completed tasks in 61.2% of the time required by users of the same browser without PadPrints. We also observed significant decreases in the number of pages acessed when using PadPrints. User found browsing with PadPrints more satisfying than using Netscape alone.

keywords:
World Wide Web, Web navigation, web browser, usability, Pad++, zooming user interface (ZUI), hypertext, multiscale interfaces, information visualization


title:
Approximate nearest neighbors: towards removing the curse of dimensionality

abstract:
The nearest neighbor problem is the following: Given a set of n points P = {p1,...pn} in some metric space X, preprocess P so as to efficiently answer queries which require finding the point P closet to a query point q in X. We forcus on the particularly interesting case of the d-dimensional Euclidean space where X = reals unde some lp norm. Despire decades of effort, the current solutions are far from satisfactory; in fact, for large d, in theory or in practice, they provide little improvement over the brute-force algorithm which compares the query point to each data point. Of late, there has been some interest in the approximate nearest neighbors problem, which is: Find a point p that is an e-approximate nearest neighor of the query q in that for all p prime in P, d(p,q) is less than equal to (1 + e)d(p-prime, q). We present two algorithmic results for the approximate version that significantly improve the known bounds: (a) preprocessing cost polynomial in log n and d, and only a mildly exponential preprocessing cost O(n) x O(1/e)^d. Further, applying a classical geometric lemma on random projections (for which we give a simpler proof, we obtain the first known algorithm with polynomial preprocessing and query time polynomial in d and log n. Unfortunately, for small e, the latter is purely theoretical result since the exponent depends on 1/e. Experimental results indicate that our first algorithm offers orders of magnitude improvement on running time over real data sets. Its key ingredient is the notion of locality-sensitive heashing which may be of independent interest; here, we give applications to information retrieval, pattern recognition, dynamic closest-pairs, and fast-clustering algorithms.


title:
Object-oriented spreadsheets: the analytic spreadsheet package

abstract:
The ASP package, a spreadsheet implemented in Smalltalk-80, is discussed. A description of the unique data manipulation features of ASP is given. A discussion of how these features arise from the Smalltalk-80 environment is included, with emphasis on features not common to all object oriented languages.


title:
The Gridfit algorithm: an efficient and effective approach to visualizing large amounts of spatial data

keywords:
interfaces to databases, visualizing geographical data, visualizing large data sets, visualizing spatially referenced data


title:
TOPIC ISLANDS-a wavelet-based text visualization system

abstract:
We present a novel approach to visualize and explore unstructured text. The underlying technology, called TOPIC-O-GRAPHY, applies wavelet transforms to a custom digital signal constructed from words within a document. The resultant multiresolution wavelet energy is used to analyze the characteristics of the narrative flow in the frequency domain, such as theme changes, which is then related to overall thematic characteristics of a document using statistical methods. The thematic characteristics of a document can be analyzed at varying degrees of detail, ranging from section-sized text partitions to partitions consisting of a few words. Using this technology, we are developing a visualization system prototype known as TOPIC ISLANDS to browse a document, generate fuzzy document outlines, summarize text by levels of detail and according to user interests, define meaningful subdocuments, query text content, and provide summaries of topic evolution.

keywords:
information retrieval, information visualization, text visualization, wavelet transform


abstract:
Area cartograms are used for visualizing geographically distributed data by attaching measurements to regions of a map and sealing the regions such that their areas are proportional to the measured quantities. A continuous area cartogram is a cartogram that is constructed without changing the underlying map topology. We present a new algorithm for the construction of continuous area cartograms as a constrained optimization problem. The algorithm uses a relaxation method that exploits hierarchical resolution, constrained dynamics, and a scheme that alternates goals of achieving correct region areas and adjusting region shapes. It is compared favorably to existing methods in its ability to preserve region shape recognition cues, while still achieving high accuracy.

keywords:
anamorphosis, cartogram, constrained optimization, map transformation, thematic cartography, value-by-area map


title:
Interactive display of very large textures

abstract:
Large textures cause bottlenecks in real-time applications that often lead to a loss of interactivity. These performance bottlenecks occur because disk and network transfer, texture translation, and memory swapping. We present a software solution that alleviates the problems associated with large textures by treating texture as a bandwidth-limited resource rather than a finite resource. As a result the display of large textures is reduced to a caching problem in which texture memory serves as the primary cache for texture data, main memory as the secondary cache, and local disk the tertiary cache. By using this cache hierarchy, applications are able to maintain real-time performance while displaying textures hundreds of times larger than can fit into texture memory.

keywords:
bandwidth-limited resource, interactivity, real-time display, texture caching, texture mapping


title:
Critical zones in desert fog: aids to multiscale navigation

abstract:
In this paper, we introduce the problem of Ãdesert fog,Ã a condition wherein a view of an information world contains no information on which to base navigational decisions. We present a set of view-based navigational aids that allow navigators to find their way through desert fog in multiscale electronic worlds. Prototypes of these aids have been implemented in the Landmarking and ZTracker systems. We introduce the concept of critical zone analysis, a method of grouping objects according to their visibility in views of the information world rather than their spatial layout. This concept was derived from a formal analysis of desert fog using view-navigation theory. Our analysis informally extends view-navigation theory to accommodate spatial multiscale worlds and is detailed in the paper.

keywords:
Pad++, ZTracker, browsing, critical zone analysis, critical zones, information navigation, multiscale, navigation, residue, space-scale diagrams, view-based navigational aids, view-navigation


abstract:
Information worlds are getting ever more vast. We need, not only better environments for dealing with this vast scale, but better tools for authoring information in those environments. This paper describes a new type of tool for authoring objects in infinite pan/zoom (so-called ÃmultiscaleÃ) environments, like PAD++. Called the MultiScale Editor (MuSE) it provides a direct way to manipulate objects in scale, simplifying important operations for authoring with large, multiscale information worlds.

keywords:
ZUI, authoring, design rationale, graphic editor, information visualization, multiscale interfaces, space scale diagram, zoom views


title:
Data mountain: using spatial memory for document management

abstract:
Effective management of documents on computers has been a central user interface problem for many years. One common approach involves using 2D spatial layouts of icons representing the documents, particularly for information workspace tasks. This approach takes advantage of human 2D spatial cognition. More recently, several 3D spatial layouts have engaged 3D spatial cognition capabilities. Some have attempted to use spatial memory in 3D virtual environments. However, there has been no proof to date that spatial memory works the same way in 3D virtual environments as it does in the real world. We describe a new technique for document management called the Data Mountain, which allows users to place documents at arbitrary positions on an inclined plane in a 3D desktop virtual environment using a simple 2D interaction technique. We discuss how the design evolved in response to user feedback. We also describe a user study that shows that the Data Mountain does take advantage of spatial memory. Our study shows that the Data Mountain has statistically reliable advantages over the Microsoft Internet Explorer Favorites mechanism for managing documents of interest in an information workspace.

keywords:
3D user interfaces, desktop VR, document mangement, information visualization, spatial cognition, spatial memory


title:
Spatial querying for image retrieval: a user-oriented evaluation

abstract:
Epic is an image retrieval system that implements a novel spatial-querying mechanism. A user- centred, task-oriented, comparative evaluation of Epic was undertaken in which two versions of the system--one set up to enable spatial queries only, the other allowing textual queries only--were compared. Use was made of the two systems by design professionals in simulated work task situations, and quantitative and qualitative data collected as indicators of the levels of usersÃ satisfaction. Results demonstrated that users often had a Ãmental imageÃ of a potentially satisfying picture in mind, that they were happy to express this need in visual terms, and that in doing so they preferred to have access to EpicÃs spatial-querying facility. Success in obtaining statistically significant results appears to support validation of the novel methodological framework adopted.


title:
How reliable are the results of large-scale information retrieval experiments?

abstract:
Two stages in measurement of techniques for information retrieval are gathering of documents for relevance assessment and use of the assessments to numerically evaluate effectiveness. We consider both of these stages in the context of the TREC experiments, to determine whether they lead to measurements that are trustworthy and fair. Our detailed empirical investigation of the TREC results shows that the measured relative performance of systems appears to be reliable, but that recall is overestimated: it is likely that many relevant documents have not been found. We propose a new pooling strategy that can significantly increase the number of relevant documents found for given effort, without compromising fairness.

keywords:
document retrieval, empirical study, reliability


title:
Visual exploration of uncertainty in remote-sensing classification

keywords:
remote sensing classification, uncertainty, visualisation


title:
Sequence homology detection through large scale pattern discovery

abstract:
We describe a new approach for identifying sequence similarity between a query sequence and a database of proteins. The central idea is the use of a set ofpattems obtained from the underlying database through an one-time computation. These patterns are subsequently searched for on every query sequence presented to the system. A pattern matched by a region of the query pinpoints to a potential local similarity between that region and all the database sequences also matching that pattern. By using a set of prudently chosen patterns, the tool presented in this work is able to discover weak but biologically important similarities.


title:
Graphics and graphic information processing

keywords:
automatic generation, composition algebra, effectiveness, expressiveness, graphic design, information presentation, presentation tool, user interface Adobe Acrobat QuickTime Windows Media Player Real Player


title:
Navigating large networks with hierarchies

abstract:
This paper is aimed at the exploratory visualization of networks where there is a strength or weight associated with each link, and makes use of any hierarchy present on the nodes to aid the investigation of large networks. it describes a method of placing nodes on the plane that gives meaning to their relative positions. The paper discusses how linking and interaction principles aid the user in the exploration. Two examples are given; one of electronic mail communication over eight months within a department, another concerned with changes to a large section of a computer program.


title:
Visualising cyberspace: information visualisation in the Harmony Internet browser

abstract:
The explosive growth of information systems on the Internet has clearly demonstrated the need to organise, filter, and present information in ways which allow users to cope with the sheer quantities of information available. The scope for visualisation of Gopher and WWW spaces is restricted by the limitations of their respective data models. The far richer data model supported by the Hyper-G Internet information system is exploited by its Harmony client to provide a number of tightly-coupled, two- and three-dimensional visualisation and navigational facilities, which help provide location feedback and alleviate user disorientation.

keywords:
WWW, Internet, information systems, information visualization


abstract:
This paper describes a general visualization technique based on a common strategy for understanding paper documents when their structure is not known, which is to lay the pages of a document in a rectangular array on a large table where the overall structure and distinguishing features can be seen. Given such a presentation, the user wants to quickly view parts of the presentation in detail while remaining in context. A fisheye view or a magnifying lens might be used for this, but they fail to adequately show the global context. The Document Lens is a 3D visualization for large rectangular presentations that allows the user to quickly focus on a part of a presentation while continuously remaining in context. The user grabs a rectangular lens and pulls it around to focus on the desired area at the desired magnification. The presentation outside the lens is stretched to provide a continuous display of the global context. This stretching is efficiently implemented with affine transformations, allowing text documents to be viewed as a whole with an interactive visualization.

keywords:
3D interaction techniques, graphic presentations, interface metaphors, screen layout, user interface design issues


title:
Table Lens as a tool for making sense of data

abstract:
The Table Lens is a visualization for searching for patterns and outliers in multivariate datasets. It supports a lightweight form of exploratory data analysis (EDA) by integrating a familiar organization, the table, with graphical representations and a small set of direct manipulation operators. We examine the EDA process as a special case of a generic process, which we call sensemaking. Using a GOMS methodology, we characterize a few central EDA tasks and compare performance of the Table Lens and one of the best of the more traditional graphical tools for EDA i.e. Splus. This analysis reveals that Table Lens is more or less on par with the power of Splus, while requiring the use of fewer specialized graphical representations. It essentially combines the graphical power of Splus with the direct manipulation and generic properties of spreadsheets and relational database front ends. We also propose a number of design refinements that are suggested by our task characterizations and analyses.

keywords:
GOMS, database visualization, evaluation, exploratory data analysis, information visualization, multivariate visualization


title:
Excentric labeling: dynamic neighborhood labeling for data visualization

abstract:
The widespread use of information visualization is hampered by the lack of effective labeling techniques. An informal taxonomy of labeling methods is proposed. We then describe Ãexcentric labelingÃ, a new dynamic technique to label a neighborhood of objects located around the cursor. This technique does not intrude into the existing interaction, it is not computationally intensive, and was easily applied to several visualization applications. A pilot study with eight subjects indicates a strong speed benefit over a zoom interface for tasks that involve the exploration of large numbers of objects. Observations and comments from users are presented.

keywords:
dynamic labeling, evaluation, label, visualization


title:
A space based model for user interaction in shared synthetic environments

abstract:
In a distributed shared synthetic environment with provisions for high quality 3D visualization and interaction, it is possible to implement a powerful variant of a roomslspace metaphor based on the concept of presence or proximity between participants in 3D space. This kind of model can be used as an interface between the user and the computer, for overview and control of applications, tile systems, networks and ofher computer resources, as well as for communication and collaboration with other users in the networked environment. We model proximity with a geometric volume of the immediate surroundings, [he aura, of the participantÃs representation in the synthetic environment. This proximity, or aura, is used to establish presence at meetings, to establish communication charnels and to provide interaction.

keywords:
3D, CSCW, communication, control, distribution, resource sharing, user interaction, virtual reality, visualization


title:
Do algorithm animations assist learning? an empirical study and analysis

abstract:
Algorithm animations are dynamic graphical illustrations of computer algorithms, and they are used as teaching aids to help explain how the algorithms work. Although many people believe that algorithm animations are useful this way, no empirical evidence has ever been presented supporting this belief. We have conducted an empirical study of a priority queue algorithm animation, and the studyÃs results indicate that the animation only slightly assisted student understanding. In this article, we analyze those results and hypothesize why algorithm animations may not be as helpful as was initially hoped. We also develop guidelines for making algorithm animations more useful in the future.

keywords:
algorithm animation, empirical studies, software visualization


title:
Using icons to find documents: simplicity is critical

abstract:
A common task at almost any computer interface is that of searching for documents, which GUIs typically represent with icons. Oddly, little research has been done on the processes underlying icon search. This paper outlines the factors involved in icon search and proposes a model of the process. An experiment was conducted which suggests that the proposed model is sound, and that the most important factor in searching for files is the type of icons used. In general, simple icons (those discriminable based on a few features) seem to help users, while complex icons are no better than simple rectangles.

keywords:
empirical evaluation, fromal models of the user, icons, screen design


abstract:
Many applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing allows the user to dynamically interact with the drawing of a graph. In this paper, we discuss features that are essential for an interactive orthogonal graph drawing system. We also describe some possible interactive drawing scenarios, present results on two of them, and compare their performance.

keywords:
Graph Drawing, orthogonal graph drawing, interactive orthogonal graph drawing, information visualization, graphical user interface.


title:
Knowledge Mining With VxInsight: Discovery ThroughInteraction

keywords:
browsing, graphical user interface, information retrieval, information visualization


title:
A texture thesaurus for browsing large aerial photographs


title:
Experiences with the alternate reality kit: an example of the tension between literalism and magic

abstract:
This paper presents an overview of the Alternate Reality Kit (ARK), an animated environment for creating interactive simulations. ARK is built upon a physical-world metaphor: all objects have an image, a position, a velocity, and can experience forces. Users manipulate objects with a mouse-operated "hand" which enables them to carry and throw objects, to press buttons, and to operate sliders. The interface features are discussed in light of a general user interface tension between literalism and magic. Literal features are defined to be those that are true to the interface's metaphor. Literal features enhance an interface's learnability. Magical features are defined to be those capabilities that deliberately violate the metaphor in order to provide enhanced functionality. Discussion of each ARK feature includes informal observations of early ARK users, an assessment of the feature's learnability, of its usefulness, and of its position on the magical-literal axis. Even though ARK includes magical features, applications-level users have be trained in a few minutes. Although this paper is about ARK, the tension between literalism and magic raises some interesting questions on its own. Some of these questions are presented briefly in the conclusion.

keywords:
simulations, alternative reality, user interface


title:
Visualization of search results: a comparative evaluation of text, 2D, and 3D interfaces

keywords:
2D, 3D, evaluation, information visualization, interface design, text


abstract:
Different phylogenetic trees for the same group of species are often produced either by procedures that use diverse optimality or from different genes in the study of molecular evolution. Comparing these trees to find their similarities (e.g. agreement or consensus) and dissimilarities, i.e. distance, is thus an important issue in computational molecular biology. The nearest neighbor interchange (nni) distance and the subtree-transfer distance are two major distance metrics that have been proposed and extensively studied for different reasons. Despite their many appealing aspects such as simplicity and sensitivity to tree topologies, computing these distances has remained very challenging. This article studies the complexity and efficient approximation algorithms for computing the nni distance and a natural extension of the subtree-transfer distance, called the linear-cost subtree-transfer distance. The linear-cost subtree-transfer model is more logical than the (unit-cost) subtree-transfer model and in fact coincides with the nni model under certain conditions. The following results have been obtained a part of our project of building a comprehensive software package for computing distances between phylogenies. 1. Computing the nni distance is NP-complete. This solves a 25 year old open question appearing again and again in, for example, under the complexity-theoretic assumption that P != NP. We also answer an open questioin regarding the nni distance between unlabeled trees for which an erroneous proof appeared in [19]. We give an algorithm to compute the optimal nni sequence in time O(n^2 log n + n . 2 ^ (0(d))), where the nni distance is at most d. The algorithm allows us to implement practical programs when d is small. All above results also hold for linear-cost subtree-transfer. 2. Biological applications require us to extend the nni and linear-cost subtree transfer models to weight phylogenies, where edge weights indicate the length of evolution along each edge. We present a logarithmic ration approximation algorithm for nni and a ration 2 approximation algorithm for linear-cost subtree-transfer, on weighted trees.


title:
On power-law relationships of the Internet topology

abstract:
Despite the apparent randomness of the Internet, we discover some surprisingly simple power-laws of the Internet topology. These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period. We show that our power-laws fit the real data very well resulting in correlation coefficients of 96% or higher.Our observations provide a novel perspective of the structure of the Internet. The power-laws describe concisely skewed distributions of graph properties such as the node outdegree. In addition, these power-laws can be used to estimate important parameters such as the average neighborhood size, and facilitate the design and the performance analysis of protocols. Furthermore, we can use them to generate and select realistic topologies for simulation purposes.


title:
The use of logging data in the design of a new text editor

abstract:
Many different human factors techniques are available to the designer of a new computer system. This case study examines how one technique, the use of logging data, was used throughout the design of a new text editor which is measurably easy to learn and easy to use. Logging data was used in four areas: keyboard design, the initial design of the editor's command set, refinements made later in the design cycle, and the construction of a system performance benchmark.


title:
Hierarchical parallel coordinates for exploration of large datasets

abstract:
Our ability to accumulate large, complex (multivariate) data sets has far exceeded our ability to effectively process them in search of patterns, anomalies, and other interesting features. Conventional multivariate visualization techniques generally do not scale well with respect to the size of the data set. The focus of this paper is on the interactive visualization of large multivariate data sets based on a number of novel extensions to the parallel coordinates display technique. We develop a multiresolutional view of the data via hierarchical clustering, and use a variation on parallel coordinates to convey aggregation information for the resulting clusters. Users can then navigate the resulting structure until the desired focus region and level of detail is reached, using our suite of navigational and filtering tools. We describe the design and implementation of our hierarchical parallel coordinates system which is based on extending the XmdvTool system. Lastly, we show examples of the tools and techniques applied to large (hundreds of thousands of records) multivariate data sets.

keywords:
hierarchical data exploration, large-scale multivariate data visualization, parallel coordinates


title:
The ecological approach to text visualization


title:
Quintary trees: a file structure for multidimensional database systems

abstract:
In this paper we present a file structure designed for a database system in which four types of retrieval requests (queries) are allowed: exact match,partial match, range, and partial range queries. For a file of N records, each of k keys, the worst-case running times of our search algorithms are bounded above, respectively, by O(k + log N), O(t + 3k-Ã(s + log N)), O(t + (log N)k), and O(t + 3k-s(log N)Ã) where s is the number of keys specified in a partial match (or range) query and t is the number of records retrieved by the query. The fde structure can be built in O(N(log N)k/(k - l)!) time and requires similar storage; by a slight modification, both of these requirements can be reduced to O(N(log N)k-Ã/(k - l)!). We also sketch outlines for inserting and deleting records that require O(k + (log N)k) time, on the average. This structure achieves faster response time than previously known structures (for many of the queries) at the cost of extra storage.

keywords:
database system, exact match queries, file maintenance, information retrieval, key, multidimensional space, queries, range search, search


title:
The Complexity of Some Problems on Subsequences and Supersequences


abstract:
We describe WEST, a WEb browser for Small Terminals, that aims to solve some of the problems associated with accessing web pages on hand-held devices. Through a novel combination of text reduction and focus+context visualization, users can access web pages from a very limited display environment, since the system will provide an overview of the contents of a web page even when it is too large to be displayed in its entirety. To make maximum use of the limited resources available on a typical hand-held terminal, much of the most demanding work is done by a proxy server, allowing the terminal to concentrate on the task of providing responsive user interaction. The system makes use of some interaction concepts reminiscent of those defined in the Wireless Application Protocol (WAP), making it possible to utilize the techniques described here for WAP-compliant devices and services that may become available in the near future.

keywords:
WAP (wireless application protocol), flip zooming, focus+context visualization, hand-held devices, proxy systems, text reduction, web browser


abstract:
A method is presented for representing botanical trees, given three-dimensional points and connections. Limbs are modeled as generalized cylinders whose axes are space curves that interpolate the points A free-form surface connects branching limbs. "'Blobby'" techniques are used to model the tree trunk as a series of non-circular cross sections. Bark is simulated with a bump map digitized from real world bark; leaves are textures mapped onto simple surfaces.

keywords:
blobby surface, bump map, generalized cylinder, interpolation, modeling, ramiform, space curve, spline, texture map


title:
Information visualization: perception for design


title:
Large networks present visualization challenges

abstract:
There are a variety of standard techniques for managing the display of large data sets. These include sampling the data, sliding, or coalescing semantically chosen subsets or relying on distorted views such as fisheye [8] or hyperbolic [7] projections. Although these methods are useful they clearly do not provide all the answers, especially when analyzing network-based data. In this article, we describe two uncustomary approaches: a project in large-scale graphics and network displays, and an experiment with a novel graphical representation of networks.


title:
Virtual environments for geographic visualization: potential and challenges

abstract:
Virtual environment (VE) technologies have considerable potential to extend the power of information visualization methods, and those of scientific visualization more broadly. Our specific focus here is on VE technologies as a medium for geographic visualization and on some of the challenges that must be addressed if the potential of VE is to be realized in this context.

keywords:
collaboration, interactivity, maps, scientific visualization, virtual reality


title:
The scent of a site: a system for analyzing and predicting information scent, usage, and usability of a Web site

abstract:
Designers and researchers of users' interactions with the World Wide Web need tools that permit the rapid exploration of hypotheses about complex interactions of user goals, user behaviors, and Web site designs. We present an architecture and system for the analysis and prediction of user behavior and Web site usability. The system integrates research on human information foraging theory, a reference model of information visualization and Web data-mining techniques. The system also incorporates new methods of Web site visualization (Dome Tree, Usage Based Layouts), a new predictive modeling technique for Web site use (Web User Flow by Information Scent, WUFIS), and new Web usability metrics.

keywords:
World Wide Web, data mining, dome tree, information foraging, information scent, information visualization, longest repeated subsequences, usability, usage-based layout


abstract:
Search engines do not index sites equally, may not index new pages for months, and no engine indexes more than about 16% of the Web. As the Web becomes a major communications medium, the data on it must be made more accessible.


title:
The visual display of quantitative information


title:
Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm

abstract:
Given an input sequence of data, a motif is a repeating pattern, possibly interspersed with "dont care" characters. The data could be a sequence of characters or sets of characters or even real values. In the first two cases, the number of motifs could potentially be exponential in the size of the input sequence and in the third case there could be infinite number of motifs (assuming two real numbers are equal if they are within some specified delta > 0 of each other). However, it has been shown in some motif based applications, such as multiple sequence alignment [Par98, PFR99], that a small subset of these motifs capture all the relevant information. Also, from an information-theoretic viewpoint, the special motifs represent the sets with low co-relation, hence of higher informational value. In this paper, we show, for any sequence with n characters, there exists only a linear (or no more than 3n) number of these special motifs and every other motif can be constructed from this set. We term these special motifs as irredundant motifs. We also present an efficient polynomial time algorithm to generate these motifs. This bound on the number of useful motifs gives validation to motif-based approaches, since the total number of irredundant motifs does not explode. This result is potentially of significance to most application.


title:
A comparison of set-based and graph-based visualisations of overlapping classification hierarchies

abstract:
The visualisation of hierarchical information sets has been a staple of Information Visualisation since the field came into being in the early 1990's. However, at present, support for visualising the correlations between multiple, overlapping sets of hierarchical information has been lacking. This is despite the realisation that for certain tasks this information is as important as the information that forms the individual hierarchies. In response to this, we have produced two early visualisation prototypes, one based on a graph visualisation, and the other on a set-based metaphor, that endeavour to display such information in a readily perceived form to potential users. The science of botanical taxonomy is used as an example of a field where such a visualisation would be useful, and also as a resource for example information sets that the prototypes can act upon. Technical and perceptual issues involved in the design and implementation of both prototypes are discussed. Following this, informal user testing on both prototypes is described, which utilised user observation techniques to elicit qualitative feedback from the taxonomists. These findings are then used to emphasise the shortcomings and advantages of each prototype, and from these probable issues for future prototyping and development are drawn.

keywords:
authors kit, conference publications, guides, instructions


title:
Guidelines for using multiple views in information visualization

abstract:
A multiple view system uses two or more distinct views to support the investigation of a single conceptual entity. Many such systems exist, ranging from computer-aided design (CAD) systems for chip design that display both the logical structure and the actual geometry of the integrated circuit to overview-plus-detail systems that show both an overview for context and a zoomed-in-view for detail. Designers of these systems must make a variety of design decisions, ranging from determining layout to constructing sophisticated coordination mechanisms. Surprisingly, little work has been done to characterize these systems or to express guidelines for their design. Based on a workshop discussion of multiple views, and based on our own design and implementation experience with these systems, we present eight guidelines for the design of multiple view systems.

keywords:
design guidelines, information visualization, multiple views, usability heuristics, user interfaces


title:
Snap-together visualization a user interface for coordinating visualizations via relational schemata

abstract:
Multiple coordinated visualizations enable users to rapidly explore complex information. However, users often need unforeseen combinations of coordinated visualizations that are appropriate for their data. Snap-Together Visualization enables data users to rapidly and dynamically mix and match visualizations and coordinations to construct custom exploration interfaces without programming. Snap's conceptual model is based on the relational database model. Users load relations into visualizations then coordinate them based on the relational joins between them. Users can create different types of coordinations such as: brushing, drill down, overview and detail view, and synchronized scrolling. Visualization developers can make their independent visualizations snap-able with a simple API. Evaluation of Snap revealed benefits, cognitive issues, and usability concerns. Data savvy users were very capable and thrilled to rapidly construct powerful coordinated visualizations. A snapped overview and detail-view coordination improved user performance by 30-80%, depending on task.

keywords:
coordination, information visualization, multiple views, relational database, tight coupling, user interface, user study


title:
Context and interaction in zoomable user interfaces

abstract:
Zoomable User Interfaces (ZUIs) are difficult to use on large information spaces in part because they provide insufficient context. Even after a short period of navigation users no longer know where they are in the information space nor where to find the information they are looking for. We propose a temporary in-place context aid that helps users position themselves in ZUIs. This context layer is a transparent view of the context that is drawn over the users' focus of attention. A second temporary in-place aid is proposed that can be used to view already visited regions of the information space. This history layer is an overlapping transparent layer that adds a history mechanism to ZUIs. We complete these orientation aids with an additional window, a hierarchy tree, that shows the users the structure of the information space and their current position within it. Context layers show users their position, history layers show them how they got there, and hierarchy trees show what information is available and where it is. ZUIs, especially those that include these new orientation aids, are difficult to use with standard interaction techniques. They provide a large number of commands which must be used frequently and on a changing image. The mouse and its buttons cannot provide a rapid access to all these commands without new interaction techniques. We propose a new type of menu, a control menu, that facilitates the use of ZUIS and which we feel can also be useful in other types of applications.

keywords:
Information Interfaces and Presentation, Interaction techniques


title:
Hierarchical flip zooming enabling parallel exploration of hierarchical visualizations

abstract:
This paper describes hierarchical Flip Zooming, a focus+context visualization technique for hierarchical information sets. It allows for independent focus+context views at each node of the hierarchy and enables parallel exploration of different branches of the hierarchy. Visualization, navigation and interaction in the Flip Zooming technique is described as well as how the technique fits into existing models of information visualization. Examples of applications using the technique are given.

keywords:
flip zooming, focus+context visualization, hierarchies, information visualization


title:
A fast multi-scale method for drawing large graphs

abstract:
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graphs of substantially larger size than any other algorithm we are awars of. For example, the algorithm achieves optimal drawings of 1000 vertex graphs in less than 3 seconds. The paper contains graphs with over 6000 nodes. The proposed algorithm embodies a new multi-scale scheme for drawing graphs, which can significantly improve the speed of essentially any force-directed method. Graphs have become an important part of recently proposed user interfaces, hence the relevance of this paper to work on interface issues.


title:
Analysis of a local-area wireless network

abstract:
To understand better how users take advantage of wireless networks, we examine a twelve-week trace of a building-wide local-area wireless network. We analyze the network for overall user behavior (when and how intensively people use the network and how much they move around), overall network traffic and load characteristics (observed throughput and symmetry of incoming and outgoing traffic), and traffic characteristics from a user point of view (observed mix of applications and number of hosts connected to by users). Amongst other results, we find that users are divided into distinct location-based sub-communities, each with its own movement, activity, and usage characteristics. Most users exploit the network for web-surfing, session-oriented activities and chat-oriented activities. The high number of chat-oriented activities shows that many users take advantage of the mobile network for synchronous communication with others. In addition to these user-specific results, we find that peak throughput is usually caused by a single user and application. Also, while incoming traffic dominates outgoing traffic overall, the opposite tends to be true during periods of peak throughput, implying that significant asymmetry in network capacity could be undesirable for our users. While these results are only valid for this local-area wireless network and user community, we believe that similar environments may exhibit similar behavior and trends. We hope that our observations will contribute to a growing understanding of mobile user behavior.

keywords:
local-area wireless networks, network analysis


title:
Three dimensional visualization of the World Wide Web

abstract:
Although large-scale public hypermedia structures such as the World Wide Web are popularly referred to as "cyberspace", the extent to which they constitute a space in the everyday sense of the word is questionable. This paper reviews recent work in the area of three dimensional (3D) visualization of the Web that has attempted to depict it in the form of a recognizable space; in other words, as a navigable landscape that may be visibly populated by its users. Our review begins by introducing a range of visualizations that address different aspects of using the Web.  These include visualizations of Web structure, especially of links, that act as 3D maps; browsing history; searches; evolution of the Web; and the presence and activities of multiple users. We then summarize the different techniques that are employed by these visualizations. We conclude with a discussion of key challenges for the future.


title:
Collaborative augmented reality environments: integrating VR, working materials, and distributed work spaces

abstract:
In this work, we present a new method for displaying stereo scenes, which speeds up the rendering time of complex geometry. We first discuss a scene splitting strategy, allowing us to partition objects to the distant background or the near foreground. Furthermore, wededuce a computation rule for positioning a cutting plane in the scene.

keywords:
3D workspace, CSCW, roomware, virtual office/project room, virtual reality, working material


title:
A comparative usability evaluation of user interfaces for online product catalog

abstract:
We conducted a comparative study of the usability of hierarchically structured and zoomable Electronic Product Catalogs (EPC). After evaluating 16 hierarchical EPC available online today we constructed a test search interface and used it for comparison with InfoZoom, a novel interface utilizing a compression technique, direct manipulation, and zooming. 26 users, who were new to the InfoZoom Interface, but familiar with the Web environment, were studied in their use of one of these catalog types. Performance on both types of interfaces was assessed in terms of search speed, accuracy, efficiency, and user satisfaction. Both interfaces had positive evaluations, but behavioral data and performance data suggest that users valued their interaction with InfoZoom more.

keywords:
e-commerce, electronic catalogs, human-computer interaction, usability evaluation, user interfaces


title:
Jazz: an extensible zoomable user interface graphics toolkit in Java

abstract:
In this paper we investigate the use of scene graphs as a general approach for implementing two-dimensional (2D) graphical applications, and in particular Zoomable User Interfaces (ZUIs). Scene graphs are typically found in three-dimensional (3D) graphics packages such as SunÂs Java3D and SGIÂs OpenInventor. They have not been widely adopted by 2D graphical user interface toolkits. To explore the effectiveness of scene graph techniques, we have developed Jazz, a general-purpose 2D scene graph toolkit. Jazz is implemented in Java using Java2D, and runs on all platforms that support Java 2. This paper describes Jazz and the lessons we learned using Jazz for ZUIs. It also discusses how 2D scene graphs can be applied to other application areas.

keywords:
Jazz, Pad++, animation, graphics, user interface management systems (UIMS), zoomable user interfaces (ZUIs)


abstract:
The study of data structures for facilitating rapid searching is a fascinating subject of both practical and theoretical interest. Knuth [KNUT73] provides a definitive treatise on the subject of searching when the search is based on only one "key," but he points out that not much was known at the time his book was published about data structures for sets that have many "keys." This subject area, which is often called "multikey searching," "multidimensional searching," or "multiple attribute retrieval," has been the focus of a great deal of research in the past few years. In this paper we study a small part of this area by surveying the work that has been done on one particular multikey searching problem. This problem is important in itself (having applications in such areas as database systems, statistics, and design automation) and, in addition, serves as a representative of the entire class of multikey searching problems.


title:
A Generalization of Algebraic Surface Drawing

abstract:
The mathematical description of three-dimensional surfaces usually falls into one of two classifications: parametric and implicit. An implicit surface is defined to be all points which satisfy some equation F (x, y, z) = 0. This form is ideally suited for image space shaded picture drawing; the pixel coordinates are substituted for x and y, and the equation is solved for z. Algorithms for drawing such objects have been developed primarily for fLrst- and second-order polynomial functions, a subcategory known as algebraic surfaces. This paper presents a new algorithm applicable to other functional forms, in particular to the summation of several Gaussian density distributions. The algorithm was created to model electron density maps of molecular structures, but it can be used for other artistically interesting shapes.


title:
System response time operator productivity, and job satisfaction

abstract:
This study examines the impact of online system response time on CRT operator productivity and job satisfaction. The study confirmed predictions with regard to total transactions and productive transactions: beth decreased as response time increased. A relationship was also found between increased response times and reduced job satisfaction.


title:
Time, clocks, and the ordering of events in a distributed system

abstract:
The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering is illustrated with a method for solving synchronization problems. The algorithm is then specialized for synchronizing physical clocks, and a bound is derived on how far out of synchrony the clocks can become.

keywords:
clock synchronization, computer networks, distributed systems, multiprocess systems


title:
Hierarchical geometric models for visible surface algorithms

abstract:
The geometric structure inherent in the definition of the shapes of three-dimensional objects and environments is used not just to define their relative motion and placement, but also to assist in solving many other problems of systems for producing pictures by computer. By using an extension of traditional structure information, or a geometric hierarchy, five significant improvements to current techniques are possible. First, the range of complexity of an environment is greatly increased while the visible complexity of any given scene is kept within a fixed upper limit. Second, a meaningful way is provided to vary the amount of detail presented in a scene. Third, "clipping" becomes a very fast logarithmic search for the resolvable parts of the environment within the field of view. Fourth, frame to frame coherence and clipping define a graphical "working set," or fraction of the total structure that should be present in primary store for immediate access by the visible surface algorithm. Finally, the geometric structure suggests a recursive descent, visible surface algorithm in which the computation time potentially grows linearly with the visible complexity of the scene.

keywords:
geometric models, hidden surface algorithms, hierarchical data structures, visible surface algorithms


title:
Does organisation by similarity assist image browsing?

abstract:
In current systems for browsing image collections, users are presented with sets of thumbnail images arranged in some default order on the screen. We are investigating whether it benefits users to have sets of thumbnails arranged according to their mutual similarity, so images that are alike are placed together. There are, of course, many possible definitions of "similarity": so far we have explored measurements based on low-level visual features, and on the textual captions assigned to the images. Here we describe two experiments, both involving designers as the participants, examining whether similarity-based arrangements of the candidate images are helpful for a picture selection task. Firstly, the two types of similarity-based arrangement were informally compared. Then, an arrangement based on visual similarity was more formally compared with a control of a random arrangement. We believe this work should be of interest to anyone designing a system that involves presenting sets of images to users.

keywords:
evaluation, image retrieval, information visualization


title:
3D or not 3D?: evaluating the effect of the third dimension in a document management system

abstract:
Several recent research systems have provided interactive three-dimensional (3D) visualizations for supporting everyday work such as file and document management. But what improvements do these 3D interfaces offer over their traditional 2D counterparts? This paper describes the comparative evaluation of two document management systems that differ only in the number of dimensions used for displaying and interacting with the data. The 3D system is heavily based on Robertson et al.'s Data Mountain, which supports users in storing, organizing and retrieving "thumbnail" representations of documents such as bookmarked Web-pages. Results show that our subjects were faster at storing and retrieving pages in the display when using the 2D interface, but not significantly so. As expected, retrieval times significantly increased as the number of thumbnails increased. Despite the lack of significant differences between the 2D and 3D interfaces, subjective assessments showed a significant preference for the 3D interface.

keywords:
3D user interfaces, document management, information visualization, spatial memory


title:
An evaluation of space-filling information visualizations for depicting hierarchical structures

abstract:
During the last decade, multimedia databases have become increasingly important in many application areas such as medicine, CAD, geography, and molecular biology. An important research issue in the field of multimedia databases is the content-based retrieval of similar multimedia objects such as images, text, and videos. However, in contrast to searching data in a relational database, a content-based retrieval requires the search of similar objects as a basic functionality of the database system. Most of the approaches addressing similarity search use a so-called feature transformation that transforms important properties of the multimedia objects into high-dimensional points (feature vectors). Thus, the similarity search is transformed into a search of points in the feature space that are close to a given query point in the high-dimensional feature space. Query processing in high-dimensional spaces has therefore been a very active research area over the last few years.  A number of new index structures and algorithms have been proposed. It has been shown that the new index structures considerably improve the performance in querying large multimedia databases. Based on recent tutorials [Berchtold and Keim 1998], in this survey we provide an overview of the current state of the art in querying multimedia databases, describing the index structures and algorithms for an efficient query processing in high-dimensional spaces. We identify the problems of processing queries in high-dimensional space, and we provide an overview of the proposed approaches to overcome these problems.

keywords:
Index Structures, Indexing high dimentional data, multimedia databases, similarity search


abstract:
This paper reviews and illustrates a direct manipulation approach to visualization of complex objects called paiidiilg mulliple views. We describe a programming model for direct manipulation in general and for painting in particular, based on simple constraints between entities in an the underlying scientific database and the components of displays used to examine the data. With this model, the original notion of Âbrushing scatterplotsÂ is easily extended.

keywords:
direct manipulation interfaces, exploratory anylysis


title:
WebQuilt: a framework for capturing and visualizing the web experience

abstract:
WebQuilt is a web logging and visualization system that helps web design teams run usability tests (both local and remote) and analyze the collected data. Logging is done through a proxy, overcoming many of the problems with server-side and client-side logging. Captured usage traces can be aggregated and visualized in a zooming interface that shows the web pages people viewed. The visualization also shows the most common paths taken through the website for a given task, as well as the optimal path for that task as designated by the designer. This paper discusses the architecture of WebQuilt and also describes how it can be extended for new kinds of analyses and visualizations.

keywords:
WebQuilt, log file analysis, usability evaluation, web proxy, web visualization


title:
MWMD: a module-based workbench for multimedia database programmers and users

abstract:
In January, 1993, a panel of experts in the area of programming languages and compilers met in a one and a half day workshop to discuss the future of research in that area. This paper is the report of their findings. Its purposes are to explain the need for, and benefits of, research in this field-- both basic and applied; to broadly survey the various parts of the field and indicate its general research directions; and to propose an initiative aimed at moving basic research results into wider use.

keywords:
multimedia database, visual querying, visualization system


title:
Procedural annotation of uncertain information

abstract:
In many applications of scientic visualization, a large quantity of data is being processed and displayed in order to enable a viewer to make informed and efective decisions. Since little data is perfect, there is almost always some degree of associated uncertainty. This uncertainty is an important part of the data and should be taken into consideration when interpreting the data. Uncertainty, however, should not overshadow the data values. Many methods that address the problem of visualizing data with uncertainty can distort the data and emphasize areas with uncertain values. We have developed a method for showing the uncertainty information together with data with minimal distraction. This method uses procedurally generated annotations which are deformed according to the uncertainty information. As another possible technique we propose distorting glyphs according to the uncertainty information.

keywords:
annotation, glyphs, procedural generation, uncertainty visualization


title:
FastSplats: optimized splatting on rectilinear grids

abstract:
Splatting is widely applied in many areas, including volume, point-based, and image-based rendering. Improvements to splatting, such as eliminating popping and color bleeding, occlusion-based acceleration, post-rendering classification and shading, have all been recently accomplished. These improvements share a common need for efficient framebuffer accesses. We present an optimized software splatting package, using a newly designed primitive, called FastSplat, to scan-convert footprints. Our approach does not use texture mapping hardware, but supports the whole pipeline in memory. In such an integrated pipeline, we are then able to study the optimization strategies and address image quality issues. While this research is meant for a study of the inherent trade-off of splatting, our renderer, purley in software, achieves 3 to 5 times speedups over a top-end texture hardware (for opaque data sets) implementation. We further propose a way of efficient occlusion culling using a summed area table of opacity. 3D solid texturing and bump mapping capabilities are demonstrated to show the flexibility of such an integrated rendering pipeline. A detailed numerical error analysis, in addition to the performance and storage issues, is also presented. Our approach requires low storage and uses simple operations. Thus, it is easily implementable in hardware.


title:
WEAVE: a system for visually linking 3-D and statistical visualizations, applied to cardiac simulation and measurement data

abstract:
WEAVE (Workbench Environment for Analysis and Visual Exploration) is an environment for creating interactive visualization applications. WEAVE differs from previous systems in that it provides transparent linking between custom 3-D visualizations and multidimensional statistical representations, and provides interactive color brushing betwen all visualizations. In this paper, we demonstrate how WEAVE can be used to rapidly prototype a biomedical application, weaving together simulation data, measurement data, and 3-d anatomical data concerning he propagation of excitation in the heart. These linked statistical nd custom three-dimensional visualizations of the heart can allow cientists to more effectively study the correspondance of structure nd behavior.

keywords:
data synthesis, heart, medical, visualization


title:
Envision: a user-centered database of computer science literature

abstract:
Project Envision is an early NSF-funded digital library effort to develop a multimedia collection of computer science literature with full-text searching and full-content retrieval capabilities. Envision was launched in 1991 in accordance with the ACM Publications Board's plans for encouraging research studies to develop an electronic archive for computer science.


title:
JDSL: The data structures library in java

abstract:
Making advanced algorithms and data structures a programming reality.


title:
A rendering algorithm for visualizing 3D scalar fields

abstract:
This paper presents a ray tracing algorithm for rendering 3D scalar fields. An illumination model is developed in which the field is characterized as a varying density emittter with a single level of scattering. This model is equivalent to a particle system in which the particles are sufficiently small. Along each ray cast from the eye, the field is expressed as a function of the ray parameter. The algorithm computes properties of the field along the ray such as the attenuated intensity, the peak density, and the center of gravity, etc.. These are mapped into HSV color space to produce an image for visualization. Images produced in this manner are perceived as a varying density 'cloud' where color highlights the computed attributes. The application of this technique is demonstrated for visualizing a three dimensional seismic data set.

keywords:
3D image, light scattering, ray tracing, thresholding


title:
ConMan: a visual programming language for interactive graphics

abstract:
Traditionally, interactive applications have been difficult to build, modify and extend. These integrated applications provide bounded functionality, have a single thread of control and a fixed user interface that must anticipate everything the user will need. Current workstations allow several processes to share the screen. With proper communication between processes, it is possible to escape previous models for application development and evolution. ConMan is a high-level visual language we use on an IRIS workstation that lets users dynamically build and modify graphics applications. To do this, a system designer disintegrates complex applications into modular components. By interactively connecting simple components, the user constructs a complete graphics application that matches the needs of a task. A connection manager controls the flow of data between individual components. As a result, we replace the usual user-machine dialog with a dynamic live performance that is orchestrated by the user.


title:
A study in interactive 3-D rotation using 2-D control devices

abstract:
This paper describes and evaluates the design of four virtual controllers for use in rotating three-dimensional objects using the mouse. Three of four of these controllers are "new" in that they extend traditional direct manipulation techniques to a 3-D environment. User performance is compared during simple and complex rotation tasks. The results indicate faster performance for complex rotations using the new continuous axes controllers compared to more traditional slider approaches. No significant differences in accuracy for complex rotations were found across the virtual controllers.A second study compared the best of these four virtual controllers (the Virtual Sphere) to a control device by Evans, Tanner and Wein. No significant differences either in time to complete rotation task or accuracy of performance were found. All but one subject indicated they preferred the Virtual Sphere because it seemed more "natural".

keywords:
3-D graphics, I/O devices, input devices, interactive graphics, mouse, real-time graphics, rotation control, user performance, virtual controllers, virtual sphere


title:
Visualization in Scientific Computing (ViSC)


abstract:
The higraph, a general kind of diagramming object, forms a visual formalism of topological nature. Higraphs are suited for a wide array of applications to databases, knowledge representation, and, most notably, the behavioral specification of complex concurrent systems using the higraph-based language of statecharts.

keywords:
higraphs, complex concurrent systems, statecharts


abstract:
This paper describes a variety of 3D interactive graphics techniques for visualizing programs. The third dimension provides an extra degree of freedom for conveying information, much as color adds to black-and-white images, animation adds to static images, and sound adds to silent animations. The examples in this paper illustrate three fundamental uses of 3D: for providing additional information about objects that are intrinsically two-dimensional, for uniting multiple views, and for capturing a history of execution. The application of dynamic three-dimensional graphics to program visualization is largely unexplored.

keywords:
3D Graphics, algorithm animation, information visualization, program visualization


abstract:
Volume rendering is a technique for visualizing sampled scalar or vector fields of three spatial dimensions without fitting geometric primitives to the data. A subset of these techniques generates images by computing 2-D projections of a colored semitransparent volume, where the color and opacity at each point are derived from the data using local operators. Since all voxels participate in the generation of each image, rendering time grows linearly with the size of the dataset. This paper presents a front-to-back image-order volume-rendering algorithm and discusses two techniques for improving its performance. The first technique employs a pyramid of binary volumes to encode spatial coherence present in the data, and the second technique uses an opacity threshold to adaptively terminate ray tracing. Although the actual time saved depends on the data, speedups of an order of magnitude have been observed for datasets of useful size and complexity. Examples from two applications are given: medical imaging and molecular graphics.

keywords:
Hierarchical spatial enumeration, medical imaging, molecular graphics, octree, ray tracing, scientific visualization, volume rendering, volume visualization, voxel


title:
Seeing the forest for the trees: hierarchical displays of hypertext structures

abstract:
Most recent hypertext systems support hierarchy only as a restricted subset of directed graph structure. Consequently they do not provide many of the capabilities for graphical information hiding and structure manipulation that a tree makes possible. This paper describes display techniques developed for IGD, a hypertext system that supports the creation of large graphical documents whose arbitrary directed graph structure is embedded in a strict hierarchy. IGD offers the full generality of arbitrary keyworded links, while simultaneously allowing hierarchies to be easily manipulated and displayed with much of their structural detail selectively abstracted.

keywords:
hypertext, hypermedia, directed-graph display, graph browser, display decluttering, electronic documents


title:
Reflections on NoteCards: seven issues for the next generation of hypermedia systems

abstract:
NoteCards, developed by a team at Xerox PARC, was designed to support the task of transforming a chaotic collection of unrelated thoughts into an integrated, orderly interpretation of ideas and their interconnections. This article presents NoteCards as a foil against which to explore some of the major limitations of the current generation of hypermedia systems, and characterizes the issues that must be addressed in designing the next generation systems.


title:
Designing documentation to compensate for delocalized plans

abstract:
Conceptual representation methods play a significant role in facilitating the software process. Recent studies explore and clarify the use of these representations and their impact on progress.

keywords:
software documentation, conceptual representation methods


title:
Interactive path analysis of web site traffic

abstract:
The goal of Path Analysis is to understand visitors' navigation of a Web site. The fundamental analysis component is a path. A path is a finite sequence of elements, typically representing URLs or a groups of URLs. A full path is an abstraction of a visit or a session, which can contain attributes described below. Subpaths represent interesting subsequences of the full paths.


title:
Funnel report mining for the MSN network

abstract:
Data mining research has long concentrated on the five main areas: clustering, association discovery, classification, forecasting and sequential patterns. Web data mining projects are concerned mainly with text mining, user segmentation, forecasting web usage and analyzing users' clickstream patterns. We present a new type of web usage mining called funnel analysis or funnel report mining. A funnel report is a study of the retention behavior among a series of pages or sites. For example, of all hits on the home page of www.msn.com, what percentages of those are followed by hits to moneycentral.msn.com? What percentage of www.msn.com hits are followed by moneycentral.msn.com, and then www.msnbc.com? What are the most interesting funnels starting with www.msn.com? Where does the greatest drop off rate occur after a user has hit MSNBC? Funnel reports are extremely useful in e-business because they give product planners an idea of how usable and well-structured their site is. From our experience performing web usage mining for the MSN network ol y sites, funnel reports are requested even more than user segmentation analyses, site affiliation studies and classification exercises. In this paper, we define a framework for funnel analysis and provide a tree-based solution we have been using successfully to extract all relevant funnels using only one scan of the data file.


title:
Information Graphics: A Comprehensive Illustrated Reference


title:
Probabilistic counting algorithms for data base applications

keywords:
algorithms, measurement, data base management


title:
Designing the User Interface: Strategies for Effective Human-Computer Interaction, 3rd edition


title:
Visualizing Abstract Objects and Relations


title:
What Will Be: How the New World of Information Will Change Our Lives


title:
Graph Drawing: Algorithms for the Visualization of Graphs, 1st edition


title:
Mmixware: A RISC Computer for the Third Millennium, 1st edition


title:
Virtual Reality: Through the New Looking Glass, 2nd edition


title:
Visual Cues: Practical Data Visualization


title:
Algorithms on Stings, Trees, and Sequences: Computer Science and Computational Biology


title:
Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies

abstract:
This paper introduces a new ÂstripÂ treemap algorithm which addresses these shortcomings, and analyzes other ÂpivotÂ algorithms we recently developed showing the trade-offs between them. These ordered treemap algorithms ensure that items near each other in the given order will be near each other in the treemap layout. Using experimental evidence from Monte Carlo trials and from actual stock market data, we show that, compared to other layout algorithms, ordered treemaps are more stable, while maintaining relatively favorable aspect ratios of the constituent rectangles. A user study with 20 participants clarifies the human performance benefits of the new algorithms. Finally, we present quantum treemap algorithms, which modify the layout of the continuous treemap algorithms to generate rectangles that are integral multiples of an input object size. The quantum treemap algorithm has been applied to PhotoMesa, an application that supports browsing of large numbers of images.

keywords:
Hierarchies, human-computer interaction, image browsers, information visualization, jazz, ordered treemaps, treemaps, trees, zoomable user interfaces (ZUIs).


title:
An empirical comparison of pie vs. linear menus

abstract:
Menus are largely formatted in a linear fashion listing items from the top to bottom of the screen or window. Pull down menus are a common example of this format. Bitmapped computer displays, however, allow greater freedom in the placement, font, and general presentation of menus. A pie menu is a format where the items are placed along the circumference of a circle at equal radial distances from the center. Pie menus gain over traditional linear menus by reducing target seek time, lowering error rates by fixing the distance factor and increasing the target size in Fitts's Law, minimizing the drift distance after target selection, and are, in general, subjectively equivalent to the linear style.

keywords:
menus, user interface, empirical studies, directional selection


title:
Computer Architecture; A Quantitative Approach, 1st edition


title:
Introduction to the Theory of Neural Computation, 1st edition


title:
Time Series Analysis, Forecasting and Control


title:
The Art of Human-Computer Interface Design


title:
Dynamic Graphics for Statistics, 1st edition


title:
Software Metrics: A Rigorous and Practical Approach, 2nd edition


title:
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals

abstract:
Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce zero-dimensional or one-dimensional aggregates. Applications need the N-dimensional generalization of these operators. This paper defines that operator, called the data cube or simply cube. The cube operator generalizes the histogram, crosstabulation, roll-up, drill-down, and sub-total constructs found in most report writers. The novelty is that cubes are relations. Consequently, the cube operator can be imbedded in more complex non-procedural data analysis programs. The cube operator treats each of the N aggregation attributes as a dimension of N-space. The aggregate of a particular set of attribute values is a point in this space. The set of points forms an N-dimensional cube. Super-aggregates are computed by aggregating the N-cube to lower dimensional spaces. This paper (1) explains the cube and roll-up operators, (2) shows how they fit in SQL, (3) explains how users can define new aggregate functions for cubes, and (4) discusses efficient techniques to compute the cube. Many of these features are being added to the SQL Standard.

keywords:
aggregation, analysis, data cube, data mining, database, query, summarization


title:
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching

abstract:
Pivot-based algorithms are effective tools for proximity searching in metric spaces. They allow trading space overhead for number of distance evaluations performed at query time. With additional search structures (that pose extra space overhead) they can also reduce the amount of side computations. We introduce a new data structure, the Fixed Queries Array (FQA), whose novelties are (1) it permits sublinear extra CPU time without any extra data structure; (2) it permits trading number of pivot points for their precision so as to make better use of the available memory. We show experimentally that the FQA is an efficient tool to search in metric spaces and that it compares favorably against other state of the art approaches. Its simplicity converts it into a simple yet effective tool for practitioners seeking for a black-box method to plug into their applications.

keywords:
fixed queries tree, metric spaces, range search, similarity search


title:
GeoVISTA studio: a codeless visual programming environment for geoscientific data analysis and visualization

abstract:
The fundamental goal of the GeoVISTA Studio project is to improve geoscientific analysis by providing an environment that operationally integrates a wide range of analysis activities, including those both computationally and visually based. We argue here that improving the infrastructure used in analysis has far-reaching potential to better integrate human-based and computationally-based expertise, and so ultimately improve scientific outcomes. But to address these challenges, some difficult system design and software engineering problems must be overcome. This paper illustrates the design of a component-oriented system, GeoVISTA Studio , as a means to overcome such difficulties by using state-of-the-art component-based software engineering techniques. Advantages described include: ease of program construction (visual programming), an open (nonproprietary) architecture, simple component-based integration and advanced deployment methods. This versatility has the potential to change the nature of systems development for the geosciences, providing better mechanisms to coordinate complex functionality, and as a consequence, to improve analysis by closer integration of software tools and better engagement of the human expert. Two example applications are presented to illustrate the potentia l of the Studio environment for exploring and better understanding large, complex geographical datasets and for supporting complex visual and computational analysis.

keywords:
Java, component-oriented programming (COP), exploratory data analysis (EDA), knowledge construction, visual programming


title:
Parallel Performance Visualization: From Practice to Theory

abstract:
Parallel performance visualization presents fundamental challenges--complex data sets, the artificial aspects of parallel computation, the need for integrated analysis and visual models, and the dependence on the user's mental perspective. Despite these challenges, important concepts for visualization design and use have begun to emerge. A history of the practice of implementing and using visualization in performance analysis tools reveals an underlying theory in the form of an abstract model of performance visualization and applied visualization concepts. The model is based on the integration of performance evaluation models and performance displays. The concepts involve aspects of context, scaling, user perception and interaction, comparison, and extraction of information. Several performance scenarios demonstrate how to apply the model and concepts and principles in real tools to overcome the problems of understanding performance. These scenarios measure utilization and communication, utilization statistics, data access, and parallel performance optimization. The model and concepts form a solid basis for future research in parallel performance visualization.

keywords:
parallel computing, performance visualization, performance analysis, performance evaluation, performance debugging, scientific visualization


title:
Creating an Accurate Portrayal of Concurrent Executions

abstract:
Understanding and analyzing the execution of parallel and distributed systems is both important and challenging. Researchers have developed visualization tools to support users in confronting this challenge. However, experience shows that these tools can mislead as well as inform the viewer. This article discusses ways that visualization systems can hinder the viewer's comprehension of a program's execution. It then presents three characteristics that visualizations of concurrent systems should exhibit to promote an understanding of concurrent computations. The authors reveal how visualizations with reorderable, synchronous, and independent displays support an accurate representation of concurrent computations. They also describe the implementation of these essential characteristics with their own visualization tool environment, called Parade.


abstract:
Networks are critical to modern society, and a thorough understanding of how they behave is crucial to their efficient operation. Fortunately, data on networks is plentiful; by visualizing this data, it is possible to greatly improve our understanding. Our focus is on visualizing the data associated with a network and not on simply visualizing the structure of the network itself. We begin with three static network displays; two of these use geographical relationships, while the third is a matrix arrangement that gives equal emphasis to all network links. Static displays can be swamped with large amounts of data; hence we introduce direct-manipulation techniques that permit the graphs to continue to reveal relationships in the context of much more data. In effect, the static displays are parameterized so that interesting views may easily be discovered interactively. The software to carry out this network visualization is called SeeNet.

keywords:
Network visualization, parameter focusing, network data analysis, interactive graphics, data analysis, direct manipulation.


title:
Visualization of Multidimensional Shape and Texture Features in Laser Range Data Using Complex-Valued Gabor Wavelets

abstract:
This paper describes a new method for visualization and analysis of multivariate laser range data using complex-valued non-orthogonal Gabor wavelets, principal component analysis and a topological mapping network. The initial data set that provides both shape and texture information is encoded in terms of both amplitude and phase of a complex valued 2D image function. A set of carefully designed oriented Gabor filters performs a decomposition of the data and allows for retrieving local shape and texture features. The feature vector obtained from this method is multidimensional and in order to evaluate similar data features, further subspace methods to transform the data onto visualizable attributes, such as R, G, B, have to be determined. For this purpose, a feature-based visualization pipeline is proposed consisting of principal component analysis, normalization and a topological mapping network. This process finally renders a R, G, B subspace representation of the multidimensional feature vector. Our method is primarily applied to the visual analysis of features in human faces_but is not restricted to that.

keywords:
Feature-based visualization, feature extraction, wavelet transform, Gabor wavelets, multidimensional visualization, subspace mapping, principal components, shape, and texture analysis.


abstract:
This paper investigates the visualization of geometric algorithms. We discuss how limiting the domain makes it possible to create a system that enables others to use it easily. Knowledge about the domain can be very helpful in building a system which automates large parts of the userÂs task. A system can be designed to isolate the user from any concern about how graphics is done. The application need only specify ÂwhatÂ happens and need not be concerned with ÂhowÂ to make it happen on the screen. We develop a conceptual model and a framework for experimenting with it. We also present a system, GASP, which implements this model. GASP allows quick generation of three-dimensional geometric algorithm visualizations, even for highly complex algorithms. It also provides a visual debugging facility for geometric computing. We show the utility of GASP by presenting a variety of examples.

keywords:
Algorithm animation, computational geometry, three-dimensional geometric algorithms.


title:
Graph Visualization and Navigation in Information Visualization: A Survey

abstract:
This is a survey on graph visualization and navigation techniques, as used in information visualization. Graphs appear in numerous applications such as web browsing, state-transition diagrams, and data structures. The ability to visualize and to navigate in these potentially large, abstract graphs is often a crucial part of an application. Information visualization has specific requirements, which means that this survey approaches the results of traditional graph drawing from a different perspective.

keywords:
Information visualization, graph visualization, graph drawing, navigation, focus+context, fish-eye, clustering.


title:
Structure-Based Brushes: A Mechanism for Navigating Hierarchically Organized Data and Information Spaces

abstract:
Interactive selection is a critical component in exploratory visualization, allowing users to isolate subsets of the displayed information for highlighting, deleting, analysis, or focused investigation. Brushing, a popular method for implementing the selection process, has traditionally been performed in either screen space or data space. In this paper, we introduce an alternate, and potentially powerful, mode of selection that we term structure-based brushing, for selection in data sets with natural or imposed structure. Our initial implementation has focused on hierarchically structured data, specifically very large multivariate data sets structured via hierarchical clustering and partitioning algorithms. The structure-based brush allows users to navigate hierarchies by specifying focal extents and level-of-detail on a visual representation of the structure. Proximity-based coloring, which maps similar colors to data that are closely related within the structure, helps convey both structural relationships and anomalies. We describe the design and implementation of our structure-based brushing tool. We also validate its usefulness using two distinct hierarchical visualization techniques, namely hierarchical parallel coordinates and tree-maps. Finally, we discuss relationships between different classes of brushes and identify methods by which structure-based brushing could be extended to alternate data structures.

keywords:
Brushing, hierarchical representation, interactive selection, exploratory data analysis.


title:
ThemeRiver: Visualizing Thematic Changes in Large Document Collections

abstract:
The ThemeRiver visualization depicts thematic variations over time within a large collection of documents. The thematic changes are shown in the context of a time line and corresponding external events. The focus on temporal thematic change within a context framework allows a user to discern patterns that suggest relationships or trends. For example, the sudden change of thematic strength following an external event may indicate a causal relationship. Such patterns are not readily accessible in other visualizations of the data. We use a river metaphor to convey several key notions. The document collection's time line, selected thematic content, and thematic strength are indicated by the river's directed flow, composition, and changing width, respectively. The directed flow from left to right is interpreted as movement through time and the horizontal distance between two points on the river defines a time interval. At any point in time, the vertical distance, or width, of the river indicates the collective strength of the selected themes. Colored ÂcurrentsÂ flowing within the river represent individual themes. A current's vertical width narrows or broadens to indicate decreases or increases in the strength of the individual theme.

keywords:
Visualization, metaphor, trend analysis, time line.


title:
MGV: A System for Visualizing Massive Multidigraphs

abstract:
We describe MGV, an integrated visualization and exploration system for massive multidigraph navigation. It adheres to the Visual Information-Seeking Mantra: overview first, zoom and filter, then details on demand. MGV's only assumption is that the vertex set of the underlying digraph corresponds to the set of leaves of a predetermined tree $T$. MGV builds an out-of-core graph hierarchy and provides mechanisms to plug in arbitrary visual representations for each graph hierarchy slice. Navigation from one level to another of the hierarchy corresponds to the implementation of a drill-down interface. In order to provide the user with navigation control and interactive response, MGV incorporates a number of visualization techniques like interactive pixel-oriented 2D and 3D maps, statistical displays, color maps, multilinked views, and a zoomable label based interface. This makes the association of geographic information and graph data very natural. To automate the creation of the vertex set hierarchy for MGV, we use the notion of graph sketches. They can be thought of as visual indices that guide the navigation of a multigraph too large to fit on the available display. MGV follows the client-server paradigm and it is implemented in C and Java-3D. We highlight the main algorithmic and visualization techniques behind the tools and, along the way, point out several possible application scenarios. Our techniques are being applied to multigraphs defined on vertex sets with sizes ranging from 100 million to 250 million vertices.

keywords:
External memory, visualization, massive data sets, graphs, hierarchies.


abstract:
Astronomy is about to undergo a major paradigm shift, with data sets becoming larger and more homogeneous, designed for the first time in a top-down fashion. In a few years, it might be much easier for astronomers to "dial-up" a part of the sky, when they need a rapid observation, rather than wait for several months to access a (sometimes quite small) telescope. With several projects in multiple wavelengths underway-such as the SDSS, Galex, 2MASS, GSC-2, POSS2, Rosat, First, and Denis projects, each surveying a large fraction of the sky-the concept of having a digital sky, with multiple, terabyte-size databases interoperating seamlessly no longer seems outlandish. As more and more catalogs are added and linked to the existing ones in coming years and query engines become more sophisticated, astronomers will have to be just as familiar with mining data as with observing on telescopes. As a major part of that effort, the Sloan Digital Sky Survey will digitally map about half of the northern sky in five filter bands from ultraviolet to near infrared; we expect it to detect over 200 million objects in this area. Simultaneously, the project will measure redshifts for the brightest 1 million galaxies. (A redshift is the spectral displacement of a celestial body toward longer wavelengths caused by the Doppler effect or the source's gravitational field; the higher the redshift value, the more distant the object from Earth, hence the farther back in time.) In doing so, the SDSS will revolutionize astronomy, increasing the amount of information made available to researchers by several orders of magnitude. The resultant archive available for scientific research will be large (exceeding several terabytes) and complex-including textual information, derived parameters, multiband images, and spectra. The catalog will let astronomers study the universe's evolution in greater detail and should serve as the standard reference for the next several decades. As this article describes, the potential scientific impact of the survey is stunning, but to realize its potential, data must be turned into knowledge. As I'll indicate, this is not easy, for the survey's information content will be several times larger than the entire text contained in the Library of Congress.


title:
The Application Visualization System: A Computational Environment for Scientific Visualization

abstract:
A software system for developing interactive scientific visualization applications quickly, with a minimum of programming effort, is described. This application visualization system (AVS) is an application framework targeted at scientists and engineers. The goal of the system is to make applications that combine interactive graphics and high computational requirements easier to develop for both programmers and nonprogrammers. AVS is designed around the concept of software building blocks, or modules, which can be interconnected to form visualization applications. AVS allows flow networks of existing modules to be constructed using a direct-manipulation user interface, and it automatically generates a simple user interface to each module.


abstract:
Desirable properties of color scales are examined, and a linearized optimal color scale (LOCS) is introduced. The merits of color scales for medical image data were studied, and it was found that, in tests, although observers performed somewhat better with the newly developed LOCS than with the previously advocated heated-object color scale, they performed significantly better with a linearized gray scale than with either of the color scales. After evaluating these results, the authors suggest alternate solutions that might help observers perform better. Nonetheless, they believe that color scales can contribute to the perception of information in images.

keywords:
colour, computerised picture processing, medical computing, LOCS, heated-object color scale, linearized gray scale, linearized optimal color scale, medical image data, perception


title:
VisDB: Database Exploration Using Multidimensional Visualization

abstract:
Discusses how the VisDB system supports the query specification process by representing the result visually. The main idea behind the system stems from the view of relational database tables as sets of multidimensional data where the number of attributes corresponds to the number of dimensions. In such a view, it is often unclear. In this system, each display pixel represents one database item. Pixels are arranged and colored to indicate the item's relevance to a user query and to give a visual impression of the resulting data set.

keywords:
data visualisation, query processing, relational databases, visual databases, VisDB, data set, database exploration, display pixel, multidimensional data, multidimensional visualization, query specification process, relational database tables, user query, visual impression


title:
Information Appliances and Tools in Visage

abstract:
A workspace for information analysis must support two types of analysis: routine information reporting and exploratory analysis. We have been developing a workspace called Visage to address both types of analysis tasks. Our goal is for expert users to move easily between routine tasks and exploratory data analysis as situations demand. Furthermore, recognizing the inherent complexity of data analysis, we want a system that is accessible to occasional users yet simultaneously provides power and flexibility for expert users. Ideally, such a system should support a gradual shift to increasing expertise so that occasional users of routine interfaces can perform more detailed analyses if needed. Visage addresses these needs by providing a consistent interface to a wide variety of data manipulation and visualization primitives. Plus, it lets users combine these operations to create appliances-special-purpose applications capturing multiple steps of a routine data analysis process-in a single, simple interface. Analysts thus benefit from a common set of operations and ways to integrate information across applications. Visage provides both basic tools and specialized information appliances to help them.

keywords:
data analysis, data visualisation, report generators, Visage, consistent interface, data manipulation primitives, data visualization primitives, expert users, exploratory data analysis, information analysis workspace, information appliances, occasional users, routine information reporting, special-purpose applications, tools


title:
Extending Distortion Viewing from 2D to 3D

abstract:
Addresses the visual exploration of 3D information layouts. Several visual exploration techniques have been proposed for 2D information layouts. Many of these try to take advantage of humans' natural visual pattern-recognition abilities to understand global relationships while simultaneously integrating this knowledge with local details. This desire for detail-in-context views (also called fisheye, multiscale and distortion views) has fueled considerable research in the development of distortion viewing tools. Generally, these tools provide space for magnification of local detail by compressing the rest of the image. In considering a possible detail-in-context view for 3D layouts, we first examine 2D distortion techniques, bearing in mind the particular 3D problem of occlusion. Comparing 2D and 3D information layout adjustment tools leads directly to a 3D visual access tool that clears a line of sight to any region of interest. While our technique can extend to any type of 3D information display, we focus on graphs.

keywords:
data compression, data visualisation, three-dimensional displays, 3D distortion viewing, 3D information display, 3D information layouts, 3D visual access tool, detail-in-context views, fisheye views, global relationships, graphs, image compression, information layout adjustment tools, line of sight, local details, magnification, multiscale views, occlusion, region of interest, visual exploration techniques, visual pattern recognition


title:
TennisViewer: A Browser for Competition Trees

abstract:
A tennis novice watching a match for the first time might be surprised that the crowd erupts with cheers when a player wins one point, then barely applauds when he wins the next. The crowd is not necessarily fickle; some points are genuinely more important than others because a tennis match is hierarchically structured. One match consists of several sets. One set consists of several games. One game consists of several points. The match-winning point is the most important one. How can we make that importance visible? Our goal is to let a fan, a player, or a coach examine tennis data visually, extract the interesting parts, and jump from one item to another quickly and easily. The visualization tool should help parse the elements of a match. We developed an interactive system called TennisViewer to visualize the dynamic, tree-structured data representing a tennis match. It provides an interface for users to quickly explore tennis match information. The visualization tool reveals the overall structure of the match as well as the fine details in a single screen. It uses a 2D display of translucent layers, a design that contains elements of Tree-Maps and of the Visual Scheduler system, which was designed to help faculty and students identify mutually available (transparent) time slots when arranging group meetings. TennisViewer provides MagicLens filters to explore specialized views of the information and a time-varying display to animate all or part of a match.

keywords:
computer animation, data visualisation, interactive systems, scheduling, sport, tree data structures, user interfaces, 2D display, MagicLens filters, TennisViewer, Tree-Maps, Visual Scheduler system, animation, browser, competition trees, data analysis, group meetings, interactive system, tennis match, time-varying display, tree data structure, user interface, visualization tool


abstract:
MineSet aids knowledge discovery and supports decision making based on relational data. It uses visualization and data mining to arrive at interesting results. Providing diverse visualization tools lets users choose the most appropriate method for a given problem. The client-server architecture performs most of the computationally intensive tasks on a server, while the processed results return to the client for visualization. The paper discusses MineSet database visualization and data mining visualization.

keywords:
client-server systems, data visualisation, decision support systems, deductive databases, knowledge acquisition, relational databases, MineSet, client-server architecture, computationally intensive tasks, data mining, database visualization, decision making, knowledge discovery, relational data, visualization


title:
Exploring Large Graphs in 3D Hyperbolic Space

abstract:
Drawing graphs as nodes connected by links is visually compelling but computationally difficult. Hyperbolic space and spanning trees can reduce visual clutter, speed up layout, and provide fluid interaction. This article briefly describes a software system that explicitly attempts to handle much larger graphs than previous systems and support dynamic exploration rather than final presentation. It then discusses the applicability of this system to goals beyond simple exploration. A software system that supports graph exploration should include both a layout and an interactive drawing component. I have developed new algorithms for both layout and drawing (H3 and H3Viewer). The H3Viewer drawing algorithm remains under development, so this article presents preliminary results. I have implemented a software library that uses these algorithms. It can handle graphs of more than 100,000 edges by using a spanning tree as the backbone for the layout and drawing algorithms.

keywords:
computational geometry, computer graphics, graph theory, mathematics computing, software libraries, 3D hyperbolic space, H3Viewer drawing algorithm, fluid interaction, graph exploration, large graphs, software library, software system, spanning trees, visual clutter


title:
Principles for Information Visualization Spreadsheets

abstract:
The visualization spreadsheet provides a framework for exploring large and complex data sets. Structuring user interactions using a spreadsheet paradigm creates a powerful tool for information visualization.

keywords:
data visualisation, spreadsheet programs, information visualization, information visualization spreadsheets, spreadsheet paradigm, user interactions


abstract:
We present a rule-based approach combined with traditional geometric modelling techniques that allows easy generation of many branching objects including flowers, bushes, trees, and even nonbotanical objects. A set of components describing structural and geometrical elements of plants maps to a graph that forms the description of a specific plant and generates the geometry. Users get immediate feedback on what they've created-geometrical parameters, tropisms, and free-form deformations can control the overall shape of a plant. We demonstrate that our method handles the complexity of most real plants.

keywords:
biology computing, botany, computational geometry, computer graphics, knowledge based systems, branching object generation, bushes, flowers, free-form deformations, geometric modelling techniques, geometrical elements, geometrical parameters, interactive modeling, nonbotanical objects, plant shape, plants, rule-based approach, structural elements, trees, tropisms, user feedback


abstract:
Information visualization has been an active research topic for more than a decade. Products are starting to appear. This article discusses some of the research and commercial opportunities for information visualization over the next decade.

keywords:
data visualisation, technological forecasting, commercial opportunities, information visualization, research, software products, technological forecasting


title:
Using Perceptual Syntax to Enhance Semantic Content in Diagrams

abstract:
Diagrams are essential in documenting large information systems. They capture, communicate, and leverage knowledge indispensable for solving problems and act as cognitive externalizations (intertwining internal and external processes to extract information from the external world to enhance thought). A diagram provides a mapping from the problem domain to the visual representation by supporting cognitive processes that involve perceptual pattern finding and cognitive symbolic operations. However, not all mappings are equal, and for effectiveness we must embed a diagram's representation with characteristics, which lets users easily perceive meaningful patterns. Consequently, a diagram's effectiveness depends to some extent on how well we construct it as an input to our visual system. In our research, we focus on a class of diagrams commonly referred to as graphs or node-link diagrams. Nodes representing entities, objects, or processes, and links or edges representing relationships between the nodes characterize them. Their most common form is outline circles or boxes denoting nodes and lines of different types representing links between the nodes. Entity-relationship diagrams, software structure diagrams, and data-flow models are examples of node-link diagrams used to model the structure of processes, software, or data.

keywords:
diagrams, object recognition, cognitive externalizations, cognitive symbolic operations, data-flow models, diagrams, entity-relationship diagrams, large information systems, node-link diagrams, perceptual pattern finding, perceptual syntax, semantic content, software structure diagrams, visual representation


title:
Query by Image and Video Content: The QBIC System

abstract:
Advances in scanning, networking, compression and video technology--and the proliferation of multimedia computers--have led to the generation of large on-line collections of images and videos. These collections have created a need for new methods to locate specific images or video clips. The Query by Image Content (QBIC) project is studying methods to extend and complement text-based retrievals by querying and retrieving images and videos by content. Queries can be performed using attributes such as colors, textures, shapes, and object position. Video-specific queries include those on camera motion parameters like zoom, pan, and object motion. The project has resulted in a prototype system with two major steps: database population and query. In population, methods identify objects in still images, segment videos into short sequences called shots, and compute features describing color, texture, shape, position, or motion information. In database query, images and shots can be retrieved by example ("Show me images similar to this image") or by selecting properties from pickers such as a color wheel, a sketched shape, a list of camera motions, or a combination of these. Key QBIC technical issues include a visual query language and a graphical user interface that lets users form a query by painting, sketching, or selecting graphical elements. Key also are indexing techniques for high-dimensional features describing image and video content, automatic segmentation techniques for images (to identify interesting objects), and videos (to identify shots and interesting moving and static objects), and similarity retrieval (to match human perception). QBIC technology has moved into the Ultimedia and Digital Library commercial IBM products.


title:
VMW: A Visualization-Based Microarchitecture Workbench

abstract:
Superscalar processor design requires increasingly sophisticated software tools. The visualization-based microarchitecture workbench described in the paper addresses weaknesses common to most performance simulators: the lack of retargetability, visualization support, and interactive control. VMW provides a multifunction workbench for aiding designers of modern superscalar processors. It facilitates rigorous machine specification by providing specification templates at both the architecture and microarchitecture levels.

keywords:
data visualisation, formal specification, logic CAD, microprocessor chips, parallel architectures, performance evaluation, virtual machines, VMW, machine specification, multifunction workbench, performance simulators, retargetability, software tools, superscalar processor design, visualization-based microarchitecture workbench


abstract:
The invisible nature of software hides system complexity, particularly for large team-oriented projects. The authors have evolved four innovative visual representations of code to help solve this problem: line representation; pixel representation; file summary representation; and hierarchical representation. We first describe these four visual code representations and then discuss the interaction techniques for manipulating them. We illustrate our software visualization techniques through five case studies. The first three focus on software history and static software characteristics; the last two discuss execution behavior. The software library and its implementation are then described. Finally, we briefly review some related work and compare and contrast our different techniques for visualizing software.

keywords:
data visualisation, software engineering, visual programming, case studies, execution behavior, file summary representation, hierarchical representation, interaction techniques, large team-oriented projects, line representation, pixel representation, software history, software library, software visualization, static software characteristics, system complexity, visual code representations


title:
The MIPS R10000 Superscalar Microprocessor

abstract:
The Mips R10000 is a dynamic, superscalar microprocessor that implements the 64-bit Mips 4 instruction set architecture. It fetches and decodes four instructions per cycle and dynamically issues them to five fully-pipelined, low-latency execution units. Instructions can be fetched and executed speculatively beyond branches. Instructions graduate in order upon completion. Although execution is out of order, the processor still provides sequential memory consistency and precise exception handling. The R10000 is designed for high performance, even in large, real-world applications with poor memory locality. With speculative execution, it calculates memory addresses and initiates cache refills early. Its hierarchical, nonblocking memory system helps hide memory latency with two levels of set-associative, write-back caches.

keywords:
microprocessor chips, Mips R10000 superscalar microprocessor, cache refills, exception handling, memory addresses, memory latency, sequential memory consistency, speculative execution, write-back caches


title:
Interface usage measurements in a user interface management system

abstract:
User Interface Management Systems have provided support for most user interface design personnel with the exception of dialogue evaluators. Potential support that a UIMS can provide to evaluators of user interfaces generated by the UIMS are discussed. Metrics for measuring interactive behavior have been implemented as part of a User Interface Management System. It is shown how the external control and separate dialogue description features of UIMSs make possible such measurements. These metrics are automatically mapped back to the responsible portions of the dialogue description. Reports are generated which aid interface evaluators in locating specific problems in a user interface design.


title:
Faust: An Integrated Environment for Parallel Programming

abstract:
A description is given of Faust, an integrated environment for the development of large, scientific applications. Faust includes a project-management tool, a context editor that is interfaced to a program database, and performance-evaluation tools. In Faust, all applications work is done in the context of projects, which serve as the focal point for all tool interactions. A project roughly corresponds to an executable program. Faust achieves functional integration through operations on common data sets maintained in each project. Sigma, a Faust tool designed to help users of parallel supercomputers retarget and optimize application code, helps them either fine-tune parallel code that has been automatically generated or optimize a new parallel algorithm's design. Faust includes a dynamic call-graph tool and an integrated, multiprocessor performance analysis and characterization tool set.

keywords:
Faust, Sigma, application code, common data sets, context editor, dynamic call-graph tool, functional integration, multiprocessor performance analysis, parallel programming, performance-evaluation tools, program database, programming environments, project support environments, project-management tool


abstract:
The authors address the question of how to use existing sequential Fortran code on multiprocessors. Their answer is Start/Pat, an interactive toolkit that automates the parallelization of sequential Fortran as it teaches the programmer how to exploit and understand parallel structures and architectures. The Start/Pat prototype has been installed at several user sites. The authors discuss the choice of PCF Fortran, the toolkit components, and the features of Pat and Start.

keywords:
FORTRAN, PCF Fortran, interactive toolkit, multiprocessors, parallel programming, parallel-programming toolkit, parallelization, sequential Fortran code, software tools


title:
Reverse Engineering and Design Recovery: A Taxonomy

abstract:
The key to applying computer-aided software engineering to the maintenance and enhancement of existing systems lies in applying reverse-engineering approaches. However, there is considerable confusion over the terminology used in both technical and marketplace discussions. The authors define and relate six terms: forward engineering, reverse engineering, redocumentation, design recovery, restructuring, and reengineering. The objective is not to create new terms but to rationalize the terms already in use. The resulting definitions apply to the underlying engineering processes, regardless of the degree of automation applied.

keywords:
computer-aided software engineering, design recovery, enhancement, existing systems, forward engineering, maintenance, nomenclature, redocumentation, reengineering, restructuring, reverse-engineering approaches, software engineering, taxonomy


abstract:
A tree-drawing algorithm that addresses the weaknesses of current approaches to constructing graphical user interfaces is presented. Present algorithms either do not let you draw tree nodes of varying shapes and sizes or they draw such trees in a way that does not produce trees as compact as they could be, which is especially important when diagramming a large system. Also, they cannot reuse layout information when the trees changes, so after every change the layout must be recomputed and the tree redrawn. The main difference between these traditional approaches and the author's approach is that his algorithm is more geometric. Unlike other algorithms, it uses an explicit representation of node and subtree contours, and it stores every contour as a polygon. It has three advantages over traditional algorithms. It allows one to draw trees with nodes of any polygonal shape compactly. The data structure supports insert and delete operations on subtrees. It is simple to implement, yet flexible.

keywords:
computer graphics, data structure, delete, dynamic trees, explicit representation, geometric algorithm, graphical user interfaces, insert, node contours, polygonal shape, subtree contours, subtrees, tree-drawing algorithm, trees (mathematics), user interfaces Adobe Acrobat QuickTime Windows Media Player Real Player


title:
Dynamic Queries for Visual Information Seeking

abstract:
Considers how dynamic queries allow users to Âfly throughÂ databases by adjusting widgets and viewing the animated results. In studies, users reacted to this approach with an enthusiasm more commonly associated with video games. Adoption requires research into retrieval and display algorithms and user-interface design. The author discusses how experts may benefit from visual interfaces because they will be able to formulate more complex queries and interpret intricate results.

keywords:
animated results, complex queries, database management systems, databases, display algorithms, dynamic queries, graphical user interfaces, human factors, query processing, retrieval, user-interface design, visual information seeking, visual interfaces, widgets


title:
Image-Browser Taxonomy and Guidelines for Designers

abstract:
In many applications users must browse large images. Most designers merely use two one-dimensional scroll bars or ad hoc designs for two-dimensional scroll bars. However, the complexity of two-dimensional browsing suggests that more careful analysis, design, and evaluation might lead to significant improvements. Our exploration of existing 2D browsers has led us to identify many features and a wide variety of tasks performed with the browsers. We introduce an informal specification technique to describe 2D browsers and a task taxonomy, suggest design features and guidelines, and assess existing strategies. We focus on the tools to explore a selected image and so do not cover techniques to browse a series of images or to browse large-image databases.

keywords:
computer graphics, graphical user interfaces, image processing, user interface management systems, visual databases, analysis, design, designer guidelines, evaluation, image-browser taxonomy, informal specification technique, large image browsing, selected image exploration, task taxonomy, tools, two-dimensional browsing


title:
Visualization Techniques for Mining Large Databases: A Comparison

abstract:
Visual data mining techniques have proven to be of high value in exploratory data analysis, and they also have a high potential for mining large databases. In this article, we describe and evaluate a new visualization-based approach to mining large databases. The basic idea of our visual data mining techniques is to represent as many data items as possible on the screen at the same time by mapping each data value to a pixel of the screen and arranging the pixels adequately. The major goal of this article is to evaluate our visual data mining techniques and to compare them to other well-known visualization techniques for multidimensional data: the parallel coordinate and stick-figure visualization techniques. For the evaluation of visual data mining techniques, the perception of data properties counts most, while the CPU time and the number of secondary storage accesses are only of secondary importance. In addition to testing the visualization techniques using real data, we developed a testing environment for database visualizations similar to the benchmark approach used for comparing the performance of database systems. The testing environment allows the generation of test data sets with predefined data characteristics which are important for comparing the perceptual abilities of visual data mining techniques.

keywords:
Data mining, explorative data analysis, visualizing large databases, visualizing multidimensional, multivariate data


title:
Isoperimetric Normalization of Planar Curves

abstract:
This paper presents an algorithm for transforming closed planar curves into a canonical form, independent of the viewpoint from which the original image of the contour was taken. The transformation that takes the contour to its canonical form is a member of the projective group PGL(2), chosen because PGL(2) contains all possible transformations of a plane curve under central projection onto another plane. The scheme relies on solving computationally an "isoperimetric" problem in which a transformation is sought which maximises the area of a curve given unit perimeter. In the case that the transformation is restricted to the affine subgroup there is a unique extremising transformation for any piecewise smooth closed curve. Uniqueness holds, almost always, even for curves that are not closed. In the full projective case, isoperimetric normalization is well-defined only for closed curves. We have found computational counterexamples for which there is more than one extremal transformation. Numerical algorithms are described and demonstrated both for the affine and the projective cases. Once a canonical curve is obtained, its isoperimetric area can be regarded as an invariant descriptor of shape.

keywords:
canonical form, closed planar curves, computational geometry, edge detection, image processing, invariant shape descriptor, isoperimetric normalization, object recognition, piecewise smooth closed curve, projective group PGL(2)


abstract:
A four-pass algorithm for drawing directed graphs is presented. The fist pass finds an optimal rank assignment using a network simplex algorithm. The seconds pass sets the vertex order within ranks by an iterative heuristic, incorporating a novel weight function and local transpositions to reduce crossings. The third pass finds optimal coordinates for nodes by constructing and ranking an auxiliary graph. The fourth pass makes splines to draw edges. The algorithm creates good drawings and is fast.

keywords:
auxiliary graph, computer graphics, directed graphs, four-pass algorithm, iterative heuristic, local transpositions, network simplex algorithm, novel weight function, optimal coordinates, optimal rank assignment, optimisation, splines, splines (mathematics), vertex order


abstract:
We describe a new 2-dimensional visualization algorithm capable of presenting detailed information on hundreds of items while emphasizing overall patterns in the data. This display method, which builds on Shneiderman's treemap technique, makes use of both hierarchy and similarity information. We have implemented this display in the SmartMoney Map of the Market, a web page that reports current data on over 500 publicly traded companies.

keywords:
interactive graphics, investing, treemap, visualization


title:
Evaluating the effectiveness of reliability-assurance techniques

abstract:
In the software-development life cycle, various reliability assurance techniques are routinely performed in an attempt to reduce the number of errors in a software product. These reliability-assurance techniques commonly consist of a variety of technical reviews and several levels of testing. Although the utilization of these techniques is growing, there is a lack of quantitative data on their effectiveness. This paper describes two metrics, error-detection efficiency and cost effectiveness, which were used to evaluate the reliability-assurance techniques employed in a large software project. The results of the study are also presented.


title:
Context and orientation in hypermedia networks

abstract:
The core of hypermedia's power lies in the complex networks of links that can be created within and between documents. However, these networks frequently overwhelm the user and become a source of confusion. Within Intermedia, we have developed the Web View-a tool for viewing and navigating such networks with a minimum of user confusion and disorientation. The key factors in the Web View's success are a display that combines a record of the user's path through the network with a map of the currently available links; a scope line that summarizes the number of documents and links in the network; and a set of commands that permit the user to open documents directly from the Web View.

keywords:
Information Systems, Information storage and retrieval, Systems and Software, Web View, Information Search and Retrieval, Search process, Design, Human Factors


title:
Efficient Similarity Search In Sequence Databases

abstract:
We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong. Another important observation is Parseval's theorem, which specifies that the Fourier transform preserves the Euclidean distance in the time or frequency domain.


title:
Supporting Data Mining of Large Databases by Visual Feedback Queries

abstract:
In this paper, we describe a query system that provides visual relevance feedback in querying large databases. Our goal is to support the process of data mining by representing as many data items as possible on the display. By arranging and coloring the data items as pixels according to their relevance for the query, the user gets a visual impression of the resulting data set. Using an interactive query interface, the user may change the query dynamically and receives immediate feedback by the visual representation of the resulting data set. Furthermore, by using multiple windows for different parts of a complex query, the user gets visual feedback for each part of the query and, therefore, may easier understand the overall result. Our system allows to represent the largest amount of data that can be visualized on current display technology, provides valuable feedback in querying the database, and allows the user to find results which, otherwise, would remain hidden in the database.

keywords:
Data Mining, Visualizing Large Data Sets, Visualizing Multidimensional and Multivariate Data, Visual Query Systems, Interfaces to Database Systems


title:
Toward Flexible Control of the Temporal Mapping from Concurrent Program Events to Animations

abstract:
As parallel and distributed computers become more widely available and used, the already important process of understanding and debugging concurrent programs will take on even greater importance. We believe that visualization can help in the process. In this paper we discuss heretofore unaddressed issues in the visualization of concurrent programs, and present the Animation Choreographer. The Animation Choreographer allows users to view, manipulate, and explore the set of alternate feasible orderings of the program execution under study, both through the Choreographer interface and in the context of the selected visualizations, thus providing the user with a variety of temporal perspectives on the computation.


title:
Similarity Search in High Dimensions via Hashing

abstract:
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing interest in building search/index structures for performing similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. Unfortunately, all known techniques for solving this problem fall prey to the "curse of dimensionality." That is, the data structures scale poorly with data dimensionality; in fact, if the number of dimensions exceeds 10 to 20, searching in k-d trees and related structures involves the inspection of a large fraction of the database, thereby doing no better than brute-force linear search. It has been suggested that since the selection of features and the choice of a distance metric in typical applications is rather heuristic, determining an approximate nearest neighbor should suffice for most practical purposes. In this paper, we examine a novel scheme for approximate similarity search based on hashing. The basic idea is to hash the points from the database so as to ensure that the probability of collision is much higher for objects that are close to each other than for those that are far apart. We provide experimental evidence that our method gives significant improvement in running time over other methods for searching in highdimensional spaces based on hierarchical tree decomposition. Experimental results also indicate that our scheme scales well even for a relatively large number of dimensions (more than 50).


title:
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases

abstract:
We introduce a new model of similarity of time sequences that captures the intuitive notion that two sequences should be considered similar if they have enough non-overlapping time-ordered pairs of subse- quences thar are similar. The model allows the am- plitude of one of the two sequences to be scaled by any suitable amount and its offset adjusted appropriately. Two subsequences are considered similar if one can be enclosed within an envelope of a specified width drawn around the other. The model also allows non-matching gaps in the matching subsequences. The matching sub-sequences need not be aligned along the time axis. Given this model of similarity, we present fast search techniques for discovering all similar sequences in a set of sequences. These techniques can also be used to find all (sub)sequences similar to a given sequence. We applied this matching system to the U.S. mutual funds data and discovered interesting matches.


title:
MineSet(tm): A System for High-End Data Mining and Visualization

abstract:
MineSet is a highly integrated suite of client-server tools for the high-end mining and visualization of verylarge enterprise databases. MineSet represents the confluence of several important software and hardware technolo-gies: data mining algorithms, fast multiprocessing database servers, novel techniques for interactive 3-D data visual-ization, and powerful graphics workstations. MineSet provides integrated facilities for the extraction of data from var-ied sources, algorithms for mining the extracted data, and tools for the 3-D visualization of results. The mining al-gorithms allow for the discovery of previously unknown nuggets of information, while the sophisticated visualiza-tions allow the user to get a better understanding of both the data mining results, and also the interrelationships amongthe raw data ("visual data mining"). Underlying all these techniques is the ability to handle large data sets.


title:
The X-tree: An Index Structure for High-Dimensional Data

abstract:
In this paper, we propose a new method for indexing large amounts of point and spatial data in highdimensional space. An analysis shows that index structures such as the R*-tree are not adequate for indexing high-dimensional data sets. The major problem of R-tree-based index structures is the overlap of the bounding boxes in the directory, which increases with growing dimension. To avoid this problem, we introduce a new organization of the directory which uses a split algorithm minimizing overlap and additionally utilizes the concept of supernodes. The basic idea of overlap-minimizing split and supernodes is to keep the directory as hierarchical as possible, and at the same time to avoid splits in the directory that would result in high overlap. Our experiments show that for high-dimensional data, the X-tree outperforms the well-known R*-tree and the TV-tree by up to two orders of magnitude.


title:
Pearls, Swines and Sow's Ears: Interface Research Inside a Multinational Bank


title:
The LEDA Platform of Combinatorial and Geometric Computing

abstract:
LEDA is a library of efficient data types and algorithms in combinatorial and geometric computing. The main features of the library are its wide collection of data types and algorithms, the precise and readable specification of these types, its efficiency, its extendibility, and its ease of use.


abstract:
We present a geometric counting problem that arises in browsing and solve it in constant time per query using nonexhaustive tables. On the other hand, we prove that several closely related problems require exhaustive tables, no matter how much time we allow per query.


title:
Voyeur graphical views of parallel programs

abstract:
Voyeur is a prototype system that facilitates the construction of application-specific, visual views of parallel programs. These views range from textual views showing the contents of variables to graphical maps of the state of the computational domain of the program. These views have been instrumental in quickly detecting bugs that would have been difficult to detect otherwise.

keywords:
Computing Methodologies, Computer graphics, Three-Dimensional Graphics and Realism, Animation,, Computer Systems Organization, Processor architectures, Multiple Data Stream Architectures (Multiprocessors), Parallel processors, Algorithms, Theory


title:
Comparative Multivariate Visualization Across Conceptually Different Graphic Displays

abstract:
To extend the scope of multivariate data visualization, the notion of comparative visualization is introduced: it allows the comparison of visualization methods by interconnecting several different graphic displays. This linking of visualizations, together with the possibility to interactively manipulate data, enable an analyst to display the same data set with a number of conceptually different visualization methods simultaneously and to carry out graphical operations across them. Graphical effects in different displays not only reveal information about the data themselves, they also provide the basis to investigate how the different visualization methods relate to each other. With the "VisuLab", we developed a software tool for personal computers to investigate comparative multivariate data visualization.


abstract:
Many applications which would benefit from an accompanying circular graph drawing include tools which manipulate telecommunication, computer, and social networks. Previous research has produced solutions which are visually complex with respect to the number of crossings. In this paper we focus our attention on developing better and more efficient circular drawing algorithms. In particular we present an tex2html_wrap_inline99 algorithm which lays out a biconnected graph onto a single embedding circle. Furthermore, we can guarantee that if a zero crossing circular embedding exists for an input graph, then our algorithm will find it. Also, the results of extensive experiments conducted over a set of 10,328 biconnected graphs and show our technique to perform significantly better than the current technology.


title:
Representation Matters: The Effect of 3D Objects and a Spatial Metaphor in a Graphical User Interface

abstract:
As computer graphical user interfaces (GUIs) are loaded with increasingly greater numbers of objects,researchers in HCI are forced to look for the next step in constructing user interface. In this paper, weexamine the effects of employing more ÂnaturalÂ representations in GUIs. In particular, we experimentallyassess the impact of object form (2D iconic versus 3D realistic) and layout (regular versus ecological) haveon target acquisition time. Results indicate that both form and layout significantly affect performance;subjects located targets more quickly when using interfaces with 3D objects and ecological layouts thanthey do with 2D objects and regular layouts. An interface with an ecological layout, realistic objects, orboth may be an improvement over traditional interfaces.

keywords:
3D interface, graphical interface, spatial metaphor, icon, ecological layout, regular layout


title:
An Operator Interaction Framework for Visualization Systems

abstract:
Information visualization encounters a wide variety of different data domains. The visualization community has developed representation methods and interactive techniques. As a community, we have realized that the requirements in each domain are often dramatically different. In order to easily apply existing methods, researchers have developed a semiology of graphic representations. We have extended this research into a framework that includes operators and interactions in visualization systems, such as a visualization spreadsheet. We discuss properties of this framework and use it to characterize operations spanning a variety of different visualization techniques. The framework developed in this paper enables a new way of exploring and evaluating the design space of visualization operators, and helps end--users in their analysis tasks.

keywords:
information visualization, operators, user interactions,view/value, framework, spreadsheet, design, extensibility, visualization systems


title:
WebPath - A Three-Dimensional Web History

abstract:
WebPath is a virtual reality based application that provides an easily recognisable presentation of your browsing history. The different dimensions of a 3-D space are used to position representations of documents using different metrics, together with their relationships.


title:
IVORY - An Object-Oriented Framework for Physics-Based Information Visualization in Java

abstract:
We present IVORY, a newly developed, platform-independent framework for physics-based visualization. IVORY is especially designed for information visualization applications and multidimensional graph layout. It is fully implemented in Java 1.1 and its architecture features client-server setup, which allows to run the visualization even on thin clients. In addition, VRML 2.0 exports can be viewed by any VRML plugged-in WWW-browser. Individual visual metaphors are invoked into IVORY via an advanced plug-in mechanism, where plug-ins can be implemented by any experienced user. The configuration of IVORY is accomplished using a script language, called IVML. Some interactive visualization examples, such as the integration of an haptic interface illustrate the performance and versatility of our system. Our current implementation supports NT 4.0

keywords:
three-dimensional information visualization, physics-based graph layout, object-oriented visualization toolkit, multidimensional information modeling, time varying data


title:
Geographic Visualization: Designing Manipulable Maps for Exploring Temporally Varying Georeferenced Statistics

abstract:
Geographic Visualization, sometimes called cartographic visualization, is a form of information visualization in which principles from cartography, geographic information systems (GIS), Exploratory Data Analysis (EDA), and information visualization more generally are integrated in the development and assessment of visual methods that facilitate the exploration, analysis, synthesis, and presentation of georeferenced information. We report on development and use of one component of a prototype GVis environment designed to facilitate exploration, by domain experts, of time series multivariate georeferenced health statistics. Emphasis is on how manipulable dynamic GVis tools may facilitate visual thinking, pattern noticing, and hypothesis generation. The prototype facilitates the highlighting of data extremes, examination of change in geographic patterns over time, and exploration of similarity among georeferenced variables. A qualitative exploratory analysis of verbal protocols and transaction logs is used to characterize system use. Evidence produced through the characterization highlights differences among experts in data analysis strategies (particularly in relation to the use of attribute "focusingÂ combined with time series animation) and corresponding differences in success at noticing spatiotemporal patterns.


title:
The Shape of Shakespeare: Visualizing Text using Implicit Surfaces

abstract:
Information visualization focuses on the use of visual means for exploring non-visual information. While free-form text is a rich, common source of information, visualization of text is a challenging problem since text is inherently non-spatial. This paper explores the use of implicit surface models for visualizing text. We describe several techniques for text visualization that aid in understanding document content and document relationships. A simple method is defined for mapping document content to shape. By comparing the shapes of multiple documents, global content similarities and differences may be noted. In addition, we describe a visual clustering method in which documents are arranged in 3D based upon similarity scoring. Documents deemed closely related blend together as a single connected shape. Hence, a document corpus becomes a collection of shapes that reflect inter-document relationships. These techniques provide methods to visualize individual documents as well as corpus meta-data. We then combine the two techniques to produce transparent clusters enclosing individual document shapes. This provides a way to visualize both local and global contextual information. Finally, we elaborate on several potential applications of these methods.

keywords:
blobby models, document clustering, graphics, implicit surface modeling, information retrieval, information visualization, procedural visualization, text visualization, user interfaces


title:
Dynamic Aggregation with Circular Visual Designs

abstract:
One very effective method for managing large data sets is aggregation or binning. In this paper we consider two aggregation methods that are tightly coupled with interactive manipulation and the visual representation of the data. Through this integration we hope to provide effective support for the aggregation process, specifically by enabling: 1) automatic aggregation, 2) continuous change and control of the aggregation level, 3) spatially based aggregates, 4) context maintenance across different aggregate levels, and 5) feedback on the level of aggregation.


abstract:
This paper describes a general formulation of the "detail-in-context" problem, which is a central issue of fundamental importance to a wide variety of nonlinear magnification systems. A number of tools are described for dealing with this problem effectively. These tools can be applied to any continuous nonlinear magnification system, and are not tied to specific implementation features of the system that produced the original transformation. Of particular interest is the development of "seamless multi-level views", which allow multiple global views of an information space (each having different information content) to be integrated into a single view without discontinuity.


title:
Multi-Faceted Insight Through Interoperable Visual Information Analysis Paradigms

abstract:
To gain insight and understanding of complex information collections, users must be able to visualize and explore many facets of the information. This paper presents several novel visual methods from an information analyst's perspective. We present a sample scenario, using the various methods to gain a variety of insights from a large information collection. We conclude that no single paradigm or visual method is sufficient for many analytical tasks. Often a suite of integrated methods offers a better analytic environment in today's emerging culture of information overload and rapidly changing issues. We also conclude that the interactions among these visual paradigms are equally as important as, if not more important than, the paradigms themselves.

keywords:
information visualization, user scenario, information analysis, document analysis


title:
Comparative Visualization of Protein Structure-Sequence Alignments

abstract:
Protein fold recognition (threading) involves the prediction of a protein's three-dimensional shape based on its similarity to a protein whose structure is known. Fold predictions are low resolution; no effort is made to rotate the protein's component amino acid side chains into their correct spatial orientations. Rather, the goal is to recognize the protein family member that most closely resembles the target sequence of unknown structure and to create a sensible alignment of the target to the structure (i.e., a structure-sequence alignment). To complement this structure prediction method we have implemented a low resolution molecular graphics tool. Since amino acid side chain orientation is not relevant in fold recognition, amino acid residues are represented by abstract shapes or glyphs much like Lego (tm) blocks. We also borrow techniques from comparative streamline visualization to provide clean depictions of the entire protein structure model. By creating a low resolution representation of protein structure, we are able to approximately double the amount of information on the screen. This implementation also possesses the advantage of eliminating distracting and possibly misleading visual clutter resulting from the mapping of protein alignment information onto a high resolution display of a known structure.

keywords:
proteins, structure, alignment, fold recognition, threading, similarity, glyphs, streamlines, ribbons, amino acids


title:
Traversal-Based Visualization of Data Structures

abstract:
Algorithm animation systems and graphical debuggers perform the task of translating program state into visual representations. While algorithm animations typically rely on user augmented source code to produce visualizations, debuggers make use of symbolic information in the target program. As a result, visualizations produced by debuggers often lack important semantic content, making them inferior to algorithm animation systems. This paper presents a method to provide higher-level, more informative visualizations in a debugger using a technique called traversal-based visualization. The debugger traverses a data structure using a set of user-supplied patterns to identify parts of the data structure to be drawn a similar way. A declarative language is used to specify the patterns and the actions to take when the patterns are encountered. Alternatively, the user can construct traversal specifications through a graphical user interface to the declarative language. Furthermore, the debugger supports modification of data. Changes made to the on-screen representation are reflected in the underlying data.

keywords:
Picture/Image Generation, Viewing Algorithms, Visual Programming, Testing and Debugging, Debugging aids


title:
Similarity Clustering of Dimensions for an Enhanced Visualization of Multidimensional Data

abstract:
The order and arrangement of dimensions (variates) is crucial for the effectiveness of a large number of visualization techniques such as parallel coordinates, scatterplots, recursive pattern, and many others. In this paper, we describe a systematic approach to arrange the dimensions according to their similarity. The basic idea is to rearrange the data dimensions such that dimensions showing a similar behavior are positioned next to each other. For the similarity clustering of dimensions we need to define similarity measures which determine the partial or global similarity of dimensions. We then consider the problem of finding an optimal one- or two-dimensional arrangement of the dimensions based on their similarity. Theoretical considerations show that both, the one- and the two-dimensional arrangement problem are surprisingly hard problems, i.e. they are NP-complete. Our solution of the problem is therefore based on heuristic algorithms. An empirical evaluation using a number of different visualization techniques shows the high impact of our similarity clustering of dimensions on the visualization results.


title:
Algorithm Visualization For Distributed Environments

abstract:
This paper investigates the visualization of distributed algorithms. We present a conceptual model and a system, VADE, that realizes this model. Since in asynchronous distributed systems there is no way of knowing (let alone, visualizing) the ``real'' execution, we show how to generate a visualization which is consistent with the execution of the distributed algorithm. We also present the design and implementation of our system. VADE is designed so that the algorithm runs on the server's machines while the visualization is executed on a web page on the client's machine. Programmers can write animations quickly and easily with the assistance of VADE's libraries.

keywords:
Algorithm visualization, Algorithm animation, Distributed algorithms


abstract:
Decision tables, like decision trees or neural nets, are classification models used for prediction. They are induced by machine learning algorithms. A decision table consists of a hierarchical table in which each entry in a higher level table gets broken down by the values of a pair of additional attributes to form another table. The structure is similar to dimensional stacking. Presented here is a visualization method that allows a model based on many attributes to be understood even by those unfamiliar with machine learning. Various forms of interaction are used to make this visualization more useful than other static designs.

keywords:
classifier, decision table, dimensional stacking, trellis displays, relational data, data mining


title:
30 Years of Multidimensional Multivariate Visualization

abstract:
We present a survey of multidimensional multivariate (mdmv) visualization techniques developed during the last three decades. This subfield of scientific visualization deals with the analysis of data with multiple parameters or factors, and the key relationships among them. The course of development is roughly organized into four stages, within which major milestones are discussed. Recently developed techniques are explored with examples.


abstract:
When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightness of lines, graph topology, orthogonalities and proximities. A layout adjustment algorithm which can be used to create fisheye views of nested graphs is introduced. The SHriMP (Simple Hierarchical Multi-Perspective) visualization technique uses this algorithm to create fisheye views of nested graphs. This algorithm preserves straightness of lines and uniformly resizes nodes when requests for more screen space are made. In contrast to other layout adjustment algorithms, this algorithm has several variants to preserve additional selected properties of the original graph. These variants use different layout strategies to reposition nodes when the graph is distorted. The SHriMP visualization technique is demonstrated through its application to visualizing structures in large software systems.

keywords:
Visualization, nested graphs, fisheye views, node disjointness problem, graph layouts, software visualization


title:
The Botanical Beauty of Random Binary Trees


abstract:
Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental layout of directed acyclic graphs drawn as hierarchies, and its application in the DynaGraph system.


title:
Circular Layout in the Graph Layout Toolkit


abstract:
We present a technique and a program for the automatic clustering of graphs. The technique is based on several heuristics, which allows for an efficient implementation on a personal computer. Our approach is capable of clustering graphs with > 3000 vertices efficiently. The demonstration shows an interactive user environment that supports both automatic and user-controlled clustering. As an application, we consider the clustering of large WWW connectivity graphs.


title:
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

abstract:
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in CASE tools, software visualization, and VLSI design. Drawing algorithms for hierarchical graphs have been well investigated. However, the problem of straight-line representation has not been solved completely. In this paper, we answer the question: does every planar hierarchical graph admit a planar straight-line hierarchical drawing? We present an algorithm that constructs such drawings in linear time. Also, we answer a basic question for clustered graphs, that is, does every planar clustered graph admit a planar straight-line drawing with clusters drawn as convex polygons? We provide a method for such drawings based on our algorithm for hierarchical graphs.

keywords:
computational geometry, automatic graph drawing, hierarchical graph, clustered graph, straight-line drawing


