{"title":"SpaceTree: supporting exploration in large node link tree, design evolution and empirical evaluation","authors":"C. Plaisant, J. Grosjean, B. Bederson","doi":"10.1109/INFVIS.2002.1173148","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173148","url":null,"abstract":"We present a novel tree browser that builds on the conventional node link tree diagrams. It adds dynamic rescaling of branches of the tree to best fit the available screen space, optimized camera movement, and the use of preview icons summarizing the topology of the branches that cannot be expanded. In addition, it includes integrated search and filter functions. This paper reflects on the evolution of the design and highlights the principles that emerged from it. A controlled experiment showed benefits for navigation to already previously visited nodes and estimation of overall tree topology.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"17 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134363918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Building a visual database for example-based graphics generation","authors":"Michelle X. Zhou, Min Chen, Ying Feng","doi":"10.1109/INFVIS.2002.1173143","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173143","url":null,"abstract":"Example-based graphics generation systems automatically create new information visualizations by learning from existing graphic examples. As part of the effort on developing a general-purpose example-based generation system, we are building a visual database of graphic examples. In this paper, we address two main issues involved in constructing such a database: example selection and example modeling. As a result, our work offers three unique contributions: First, we build a visual database that contains a diverse collection of well-designed examples. Second, we develop a feature-based scheme to model all examples uniformly and accurately. Third, our visual database brings several important implications to the area of information visualization.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116704513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
K. Matkovič, H. Hauser, Reinhard Sainitzer, E. Gröller
{"title":"Process visualization with levels of detail","authors":"K. Matkovič, H. Hauser, Reinhard Sainitzer, E. Gröller","doi":"10.1109/INFVIS.2002.1173149","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173149","url":null,"abstract":"We demonstrate how we apply information visualization techniques to process monitoring. Virtual instruments are enhanced using history encoding instruments are capable of displaying the current value and the value from the near past. Multi-instruments are capable of displaying several data sources simultaneously. Levels of detail for virtual instruments are introduced where the screen area is inversely proportional to the information amount displayed. Furthermore the monitoring system is enhanced by using: 3D anchoring attachment of instruments to positions on a 3D model, collision avoidance a physically based spring model prevents instruments from overlapping, and focus+context rendering - giving the user a possibility to examine particular instruments in detail without loosing the context information.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129067424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A space-optimized tree visualization","authors":"Quang Vinh Nguyen, M. Huang","doi":"10.1109/INFVIS.2002.1173152","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173152","url":null,"abstract":"We describe a new method for the visualization of tree structured relational data. It can be used especially for the display of very large hierarchies in a 2-dimensional space. We discuss the advantages and limitations of current techniques of tree visualization. Our strategy is to optimize the drawing of trees in a geometrical plane and maximize the utilization of display space by allowing more nodes and links to be displayed at a limit screen resolution. We use the concept of enclosure to partition the entire display space into a collection of local regions that are assigned to all nodes in tree T for the display of their sub-trees and themselves. To enable the exploration of large hierarchies, we use a modified semantic zooming technique to view the detail of a particular part of the hierarchy at a time based on user's interest. Layout animation is also provided to preserve the mental map while the user is exploring the hierarchy by changing zoomed views.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"126 S183","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120853237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Visual unrolling of network evolution and the analysis of dynamic discourse","authors":"U. Brandes, S. Corman","doi":"10.1109/INFVIS.2002.1173160","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173160","url":null,"abstract":"A new method for visualizing the class of incrementally evolving networks is presented. In addition to the intermediate states of the network it conveys the nature of the change between them by unrolling the dynamics of the network. Each modification is shown in a separate layer of a three-dimensional representation, where the stack of layers corresponds to a time line of the evolution. We focus on discourse networks as the driving application, but our method extends to any type of network evolving in similar ways.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121204270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multiscale visualization using data cubes","authors":"Chris Stolte, Diane Tang, P. Hanrahan","doi":"10.1109/INFVIS.2002.1173141","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173141","url":null,"abstract":"Most analysts start with an overview of the data before gradually refining their view to be more focused and detailed. Multiscale pan-and-zoom systems are effective because they directly support this approach. However generating abstract overviews of large data sets is difficult, and most systems take advantage of only one type of abstraction: visual abstraction. Furthermore, these existing systems limit the analyst to a single zooming path on their data and thus a single set of abstract views. This paper presents: (1) a formalism for describing multiscale visualizations of data cubes with both data and visual abstraction, and (2) a method for independently zooming along one or more dimensions by traversing a zoom graph with nodes at different levels of detail. As an example of how to design multiscale visualizations using our system, we describe four design patterns using our formalism. These design patterns show the effectiveness of multiscale visualization of general relational databases.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132937447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
D. Keim, S. North, Christian Panse, Jörn Schneidewind
{"title":"Efficient cartogram generation: a comparison","authors":"D. Keim, S. North, Christian Panse, Jörn Schneidewind","doi":"10.1109/INFVIS.2002.1173144","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173144","url":null,"abstract":"Cartograms are a well-known technique for showing geography-related statistical information, such as population demographics and epidemiological data. The basic idea is to distort a map by resizing its regions according to a statistical parameter, but in a way that keeps the map recognizable. We deal with the problem of making continuous cartograms that strictly retain the topology of the input mesh. We compare two algorithms to solve the continuous cartogram problem. The first one uses an iterative relocation of the vertices based on scanlines. The second one is based on the Gridfit technique, which uses pixel-based distortion based on a quadtree-like data structure.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"7 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120992065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ACE: a fast multiscale eigenvectors computation for drawing huge graphs","authors":"Y. Koren, L. Carmel, D. Harel","doi":"10.1109/INFVIS.2002.1173159","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173159","url":null,"abstract":"We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of something like two orders of magnitude over the fastest algorithms we are aware of; it draws graphs of millions of nodes in less than a minute. ACE finds an optimal drawing by minimizing a quadratic energy function. The minimization problem is expressed as a generalized eigenvalue problem, which is rapidly solved using a novel algebraic multigrid technique. The same generalized eigenvalue problem seems to come up also in other fields, hence ACE appears to be applicable outside of graph drawing too.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130874065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Visual path analysis","authors":"Alan Keahey, S. Eick","doi":"10.1109/INFVIS.2002.1173163","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173163","url":null,"abstract":"We describe a system for analyzing the flow of traffic through Web sites. We decomposed the general path analysis problem into a set of distinct subproblems, and created a visual metaphor for analyzing each of them. Our system works off of multiple representations of the clickstream, and exposes the path extraction algorithms and data to the visual metaphors as Web services. We have combined the visual metaphors into a Web-based \"path analysis portal\" that lets the user easily switch between the different modes of analysis.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132648914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"InterRing: an interactive tool for visually navigating and manipulating hierarchical structures","authors":"Jing Yang, M. Ward, Elke A. Rundensteiner","doi":"10.1109/INFVIS.2002.1173151","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173151","url":null,"abstract":"Radial, space-filling (RSF) techniques for hierarchy visualization have several advantages over traditional node-link diagrams, including the ability to efficiently use the display space while effectively conveying the hierarchy structure. Several RSF systems and tools have been developed to date, each with varying degrees of support for interactive operations such as selection and navigation. We describe what we believe to be a complete set of desirable operations on hierarchical structures. We then present InterRing, an RSF hierarchy visualization system that supports a significantly more extensive set of these operations than prior systems. In particular, InterRing supports multi-focus distortions, interactive hierarchy reconfiguration, and both semi-automated and manual selection. We show the power and utility of these and other operations, and describe our on-going efforts to evaluate their effectiveness and usability.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129582912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}