@STRING{PROC = {Proceedings of the }} @INPROCEEDINGS{Andrews1998, author = {Keith Andrews and Helmut Heidegger}, title = {Information Slices: Visualising and Exploring Large Hierarchies using Cascading, Semi-Circular Discs}, pages = {9--12}, note = {Late Breaking Hot Topic Paper}, abstract = {This paper presents work in progress on a new technique for visualising and manipulating large hierarchies. The information slices approach compactly visualises hierarchical structures using a series of semi-circular discs. The technique is described in the context of our early experience with a prototype file system visualiser based on information slices.}, crossref = {INFOVIS1998} } @INPROCEEDINGS{Andrews1997, author = {Keith Andrews and Josef Wolte and Michael Pichler}, title = {Information Pyramids\texttrademark: A New Approach to Visualising Large Hierarchies}, pages = {49--52}, note = {Late Breaking Hot Topic Paper}, abstract = {This paper presents work in progress on a new technique for visualising and manipulating large hierarchies. The Information Pyramids approach compactly visualises hierarchical structures in three dimensions using pyramid-like structures, which grow upwards as the hierarchy is descended. The technique is described in the context of our early experience with a prototype file system visualiser based on Information Pyramids.}, crossref = {VIS1997} } @INPROCEEDINGS{Bachmaier2005, author = {Christian Bachmaier and Ulrik Brandes and Barbara Schlieper}, title = {Drawing Phylogenetic Trees}, pages = {1110--1121}, abstract = {We present linear-time algorithms for drawing phylogenetic trees in radial and circular representations. In radial drawings given edge lengths (representing evolutionary distances) are preserved, but labels (names of taxons represented in the leaves) need to be adjusted, whereas in circular drawings labels are perfectly spread out, but edge lengths adjusted. Our algorithms produce drawings that are unique solutions to reasonable criteria and assign to each subtree a wedge of its own. The linear running time is particularly interesting in the circular case, because our approach is a special case of Tutte’s barycentric layout algorithm involving the solution of a system of linear equations.}, crossref = {ISAAC2005}, doi = {10.1007/11602613_110} } @INPROCEEDINGS{Balzer2004, author = {Michael Balzer and Oliver Deussen}, title = {Hierarchy based {3D} Visualization of Large Software Structures}, pages = {81--82}, abstract = {Modern object-oriented programs are hierarchical systems with many thousands of interrelated subsystems. Visualization helps developers to better comprehend these large and complex systems. This work presents a three-dimensional visualization technique that represents the static structure of object-oriented software using distributions of three-dimensional objects on a two-dimensional plane. The visual complexity is reduced by adjusting the transparency of object surfaces to the distance of the viewpoint. An approach called Hierarchical Net is proposed for a clear representation of the relationships between the subsystems.}, crossref = {VISposter2004}, doi = {10.1109/VISUAL.2004.39} } @INPROCEEDINGS{Balzer2005, author = {Michael Balzer and Oliver Deussen}, title = {Voronoi Treemaps}, pages = {49--56}, abstract = {Treemaps are a well known method for the visualization of attributed hierarchical data. Previously proposed treemap layout algorithms are limited to rectangular shapes, which cause problems with the aspect ratio of the rectangles as well as with identifying the visualized hierarchical structure. The approach of Voronoi treemaps presented in this paper eliminates these problems through enabling subdivisions of and in polygons. Additionally, this allows for creating treemap visualizations within areas of arbitrary shape, such as triangles and circles, thereby enabling a more flexible adaptation of treemaps for a wider range of applications.}, crossref = {INFOVIS2005}, doi = {10.1109/INFVIS.2005.1532128} } @INPROCEEDINGS{Beaudoin1996, author = {Luc Beaudoin and Marc-Antoine Parent and Louis C. Vroomen}, title = {Cheops: A Compact Explorer For Complex Hierarchies}, pages = {87--92}, abstract = {As the amount of electronic information explodes, hierarchies to handle this information become huge and complex. Visualizing and interacting with these hierarchies become daunting tasks. The problem is exacerbated if the visualization is to be done on massmarket personal computers, with limited processing power and visual resolution. Many of the current visualization techniques work effectively for hierarchies of 1000 nodes. But as the number of nodes increases toward 5000 nodes, these techniques tend to break down. Hierarchies above 5000 nodes usually require special modifications such as clustering, which can affect visual stability. This paper introduces Cheops, a novel approach to the representation, browsing and exploration of huge, complex information hierarchies such as the Dewey Decimal system, which can contain between 1 million and 1 billion nodes. The Cheops approach maintains context within a huge hierarchy, while simultaneously providing easy access to details. This paper will also present some preliminary results from usability tests performed on an 8 wide by 9 deep classification hierarchy, which if fully populated would contain over 19 million nodes.}, crossref = {VIS1996} } @INPROCEEDINGS{Bederson2001, author = {Benjamin B. Bederson}, title = {{PhotoMesa}: A Zoomable Image Browser Using Quantum Treemaps and Bubblemaps}, pages = {71--80}, abstract = {PhotoMesa is a zoomable image browser that uses a novel treemap algorithm to present large numbers of images grouped by directory, or other available metadata. It uses a new interaction technique for zoomable user interfaces designed for novices and family use that makes it straightforward to navigate through the space of images, and impossible to get lost. PhotoMesa groups images using one of two new algorithms that lay out groups of objects in a 2D space-filling manner. Quantum treemaps are designed for laying out images or other objects of indivisible (quantum) size. They are a variation on existing treemap algorithms in that they guarantee that every generated rectangle will have a width and height that are an integral multiple of an input object size. Bubblemaps also fill space with groups of quantum-sized objects, but generate non-rectangular blobs, and utilize space more efficiently.}, crossref = {UIST2001}, doi = {10.1145/502348.502359} } @INPROCEEDINGS{Bladh2004, author = {Thomas Bladh and David A. Carr and Jeremiah Scholl}, title = {Extending Tree-Maps to Three Dimensions: A Comparative Study}, pages = {50--59}, abstract = {This paper presents StepTree, an information visualization tool designed for depicting hierarchies, such as directory structures. StepTree is similar to the hierarchy-visualization tool, Treemap, in that it uses a rectangular, space-filling methodology, but differs from Treemap in that it employs three-dimensional space, which is used to more clearly convey the structural relationships of the hierarchy. The paper includes an empirical study comparing typical search and analysis tasks using StepTree and Treemap. The study shows that users perform significantly better on tasks related to interpreting structural relationships when using StepTree. In addition, users achieved the same performance with StepTree and Treemap when doing a range of other common interpretative and navigational tasks.}, crossref = {APCHI2004} } @INPROCEEDINGS{Buchheim2002, author = {Christoph Buchheim and Michael J\"unger and Sebastian Leipert}, title = {Improving {W}alker's Algorithm to Run in Linear Time}, pages = {347--364}, abstract = {The algorithm of Walker is widely used for drawing trees of unbounded degree, and it is widely assumed to run in linear time, as the author claims in his article. But the presented algorithm clearly needs quadraticrun time. We explain the reasons for that and present a revised algorithm that creates the same layouts in linear time.}, crossref = {GD2002}, doi = {10.1007/3-540-36151-0_32} } @INPROCEEDINGS{Chaudhuri2009, author = {Abon Chaudhuri and Han-Wei Shen}, title = {A Self-adaptive Treemap-based Technique for Visualizing Hierarchical Data in {3D}}, pages = {105--112}, abstract = {In this paper, we present a novel adaptive visualization technique where the constituting polygons dynamically change their geometry and other visual attributes depending on user interaction. These changes take place with the objective of conveying required level of detail to the user through each view. Our proposed technique is successfully applied to build a treemap-based but 3D visualization of hierarchical data, a widely used information structure. This new visualization exploits its adaptive nature to address issues like cluttered display, imperceptible hierarchy, lack of smooth zoom-in and out technique which are common in tree visualization. We also present an algorithm which utilizes the flexibility of our proposed technique to deal with occlusion, a problem inherent in any 3D information visualization. On one hand, our work establishes adaptive visualization as a means of displaying tree-structured data in 3D. On the other, it promotes the technique as a potential candidate for being employed to visualize other information structures also.}, crossref = {PACIFICVIS2009}, doi = {10.1109/PACIFICVIS.2009.4906844} } @INPROCEEDINGS{Chevalier2007, author = {Fanny Chevalier and David Auber and Alexandru Telea}, title = {Structural Analysis and Visualization of {C}++ Code Evolution using Syntax Trees}, pages = {90--97}, abstract = {We present a method to detect and visualize evolution patterns in C++ source code. Our method consists of three steps. First, we extract an annotated syntax tree (AST) from each version of a given C++ source code. Next, we hash the extracted syntax nodes based on a metric combining structure and type information, and construct matches (correspondences) between similar-hash subtrees. Our technique detects code fragments which have not changed, or changed little, during the software evolution. By parameterizing the similarity metric, we can flexibly decide what is considered to be identical or not during the software evolution. Finally, we visualize the evolution of the code structure by emphasizing both changing and constant code patterns. We demonstrate our technique on a versioned code base containing a variety of changes ranging from simple to complex.}, crossref = {IWPSE2007}, doi = {10.1145/1294948.1294971} } @INPROCEEDINGS{EdChi1998, author = {Ed H. Chi and James Pitkow and Jock Mackinlay and Peter Pirolli and Rich Gossweiler and Stuart K. Card}, title = {Visualizing the evolution of Web ecologies}, pages = {400--407}, abstract = {Several visualizations 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 forms 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.}, crossref = {CHI1998}, doi = {10.1145/274644.274699} } @INPROCEEDINGS{Chuah1998, author = {Mei C. Chuah}, title = {Dynamic Aggregation with Circular Visual Designs}, pages = {35--43}, abstract = {One very effective method for managing large data sets is aggregation or binning. 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.}, crossref = {INFOVIS1998}, doi = {10.1109/INFVIS.1998.729557} } @INPROCEEDINGS{Churcher1999, author = {Neville Churcher and Lachlan Keown and Warwick Irwin}, title = {Virtual Worlds for Software Visualisation}, pages = {9--16}, abstract = {Understanding, quickly, completely and correctly, is crucial to every phase of the software development process. As system size and complexity continues to grow, effective visualisation of system components, together with their properties and relationships, becomes increasingly important in achieving understanding. Virtual worlds allow more information to be presented in visualisations while minimising the impact of cognitive information overload. In this paper, we describe our application of virtual worlds to visualisation of software engineering artifacts and present some examples from our work on object oriented software systems.}, crossref = {SOFTVIS1999}, url = {http://www.cosc.canterbury.ac.nz/research/RG/svg/softvis99/softvis99-churcher-keown-irwin.pdf} } @INPROCEEDINGS{Dachselt2001, author = {Raimund Dachselt and J\"urgen Ebert}, title = {Collapsible Cylindrical Trees: A Fast Hierarchical Navigation Technique}, pages = {79-86}, abstract = {This paper proposes a new visualization and interaction technique for medium-sized trees, called Collapsible Cylindrical Trees (CCT). Child nodes are mapped on rotating cylinders, which will be dynamically displayed or hidden to achieve a useful balance of detail and context. Besides a comprehensible three-dimensional visualization of trees, the main feature of CCT is a very fast and intuitive interaction with the displayed nodes. Only a single click is needed to reach every node and perform an action on it, such as displaying a web page. The CCT browsing technique was developed for interaction with web hierarchies but is not limited to this domain. We also present sample implementations of CCT using VRML, which show the usefulness of this intuitive tree navigation technique.}, crossref = {INFOVIS2001}, doi = {10.1109/INFVIS.2001.963284} } @INPROCEEDINGS{Dix2000, author = {Alan Dix and Russell Beale and Andy Wood}, title = {Architectures to make simple visualisations using simple systems}, pages = {51--60}, abstract = {In previous work, the first author argued for simple lightweight visualisations. These are surprisingly complex to produce due to the need for infrastructure to read files, etc. onCue, a desktop 'agent', aids the rapid production of such visualisations and their integration with desktop and Internet applications. Two examples are used dancing histograms for 2D tables and pieTrees for hierarchical numeric data. A major focus is the importance of architecture, both that of onCue itself and the underlying component infrastructure on which it is built — separation of concerns, mixed initiative computation and plug-and-play components lead to easily produced and easily used systems.}, crossref = {AVI2000}, doi = {10.1145/345513.345250} } @INPROCEEDINGS{Dmitrieva2009, author = {Julia Dmitrieva and Fons J. Verbeek}, title = {Node-Link and Containment Methods in Ontology Visualization}, abstract = {OWL Ontology language can be very expressive. This could provide difficulty in ontology understanding process. We belief, that an ontology visualization equipped with intuitive interactions can simplify this process, and help the user during ontology exploration and development. We introduce an approach representing an ontology with two different tree visualization techniques: the node-link technique, and the containment technique. These two representations show the structure of an ontology differently. The former, represents an ontology as a graph structure. This graph structure, based on the ontology hierarchy and properties, can be explored in different geometries: Euclidean, hyperbolic and spherical. The second representation shows only the hierarchical structure. The design of the containment approach is implemented in a non-standard way. In place of traditional two-dimensional space-filling techniques, we elaborate on the sphere-packing approach and make our hierarchy visualization three-dimensional. We augment this technique with the semantic zoom functionality, where the level of detail is a function of a distance from the viewer.}, crossref = {OWLED2009}, url = {http://ceur-ws.org/Vol-529/owled2009_submission_9.pdf} } @INPROCEEDINGS{Draper2008, author = {Geoffrey M. Draper and Richard F. Riesenfeld}, title = {Interactive Fan Charts: A Space-Saving Technique for Genealogical Graph Exploration}, abstract = {Fan charts are a popular method for displaying family trees in a compact way. We extend the concept of fan charts to include a number of interactive metaphors, thus transforming what was a static display medium into an interactive tool for browsing and editing genealogical data.}, crossref = {FHTW2008}, url = {http://fht.byu.edu/prev_workshops/workshop08/papers/1/1-1.pdf} } @INPROCEEDINGS{Grivet2004, author = {S\'ebastien Grivet and David Auber and Jean-Philippe Domenger and Guy Melan\c{c}on}, title = {Bubble Tree Drawing Algorithm}, pages = {633--641}, abstract = {In this paper, we present an algorithm, called Bubble Tree, for the drawing of general rooted trees. A large variety of algorithms already exists in this field. However, the goal of this algorithm is to obtain a better drawing which makes a trade off between the angular resolution and the length of the edges. We show that the Bubble Tree drawing algorithm provides a planar drawing with at most one bend per edge in linear running time.}, crossref = {ICCVG2004}, doi = {10.1007/1-4020-4179-9_91} } @INPROCEEDINGS{Ham2002, author = {Frank van Ham and Jarke J. van Wijk}, title = {Beamtrees: Compact Visualization of Large Hierarchies}, pages = {93--100}, abstract = {Beamtrees are a new method for the visualization of large hierarchical data sets. Nodes are shown as stacked circular beams, such that both the hierarchical structure as well as the size of nodes are depicted. The dimensions of beams are calculated using a variation of the treemap algorithm. A small user study indicated that beamtrees are significantly more effective than nested treemaps and cushion treemaps for the extraction of global hierarchical information.}, crossref = {INFOVIS2002}, doi = {10.1109/INFVIS.2002.1173153} } @INPROCEEDINGS{Hao2009, author = {Jie Hao and Kang Zhang and Chad Allen Gabrysch and Qiaoming Zhu}, title = {Managing Hierarchical Information on Small Screens}, pages = {429--441}, abstract = {This paper presents a visualization methodology called Radial Edgeless Tree (RELT) for visualizing and navigating hierarchical information on mobile interfaces. RELT is characterized by recursive division of a polygonal display area, space-filling, maximum screen space usage, and clarity of the hierarchical structure. It is also general and flexible enough to allow users to customize the root location and stylize the layout. The paper presents the general RELT drawing algorithm that is adaptable and customizable for different applications. We demonstrate the algorithm’s application for stock market visualization, and also present an empirical study on an emulated implementation with a currently used cell phone interface in terms of their performances in finding desired information.}, crossref = {APWEB2009}, doi = {10.1007/978-3-642-00672-2_38} } @INPROCEEDINGS{Hao2007, author = {Jie Hao and Kang Zhang and Mao Lin Huang}, title = {{RELT} -- Visualizing Trees on Mobile Devices}, pages = {344--357}, abstract = {The small screens on increasingly used mobile devices challenge the traditional visualization methods designed for desktops. This paper presents a method called "Radial Edgeless Tree" (RELT) for visualizing trees in a 2-dimensional space. It combines the existing connection tree drawing with the space-filling approach to achieve the efficient display of trees in a small geometrical area, such as the screen that are commonly used in mobile devices. We recursively calculate a set of non-overlapped polygonal nodes that are adjacent in the hierarchical manner. Thus, the display space is fully used for displaying nodes, while the hierarchical relationships among the nodes are presented by the adjacency (or boundary-sharing) of the nodes. It is different from the other traditional connection approaches that use a node-link diagram to present the parent-child relationships which waste the display space. The hierarchy spreads from north-west to south-east in a top-down manner which naturally follows the traditional way of human perception of hierarchies. We discuss the characteristics, advantages and limitations of this new technique and suggestions for future research.}, crossref = {VISUAL2007}, doi = {10.1007/978-3-540-76414-4_34} } @INPROCEEDINGS{Hong2003, author = {Seok-Hee Hong and Tom Murtagh}, title = {{PolyPlane}: An Implementation of a New Layout Algorithm For Trees In Three Dimensions}, pages = {90--91}, crossref = {INFOVISposter2003} } @INPROCEEDINGS{Horn2009, author = {Michael S. Horn and Matthew Tobiasz and Chia Shen}, title = {Visualizing Biodiversity with {Voronoi} Treemaps}, pages = {265--270}, abstract = {Introduced in 2005, the Voronoi treemap algorithm is an information visualization technique for displaying hierarchical data. Voronoi treemaps use weighted, centroidal Voronoi diagrams to create a nested tessellation of convex polygons. However, despite appealing qualities, few real world examples of Voronoi treemaps exist. In this paper, we present a multi-touch tabletop application called Involv that uses the Voronoi treemap algorithm to create an interactive visualization for the Encyclopedia of Life. Involv is the result of a year-long iterative development process and includes over 1.2 million named species organized in a nine-level hierarchy. Working in the domain of life sciences, we have encountered the need to display supplemental hierarchical data to augment information in the treemap. Thus we propose an extension of the Voronoi treemap algorithm that employs force-directed graph drawing techniques both to guide the construction of the treemap and to overlay a supplemental hierarchy.}, crossref = {ISVD2009}, doi = {10.1109/ISVD.2009.22} } @INPROCEEDINGS{Huang2009, author = {Mao Lin Huang and Tze-Haw Huang and Jiawan Zhang}, title = {{TreemapBar}: Visualizing Additional Dimensions of Data in Bar Chart}, pages = {98--103}, abstract = {Bar chart is a very common and simple graph that is mainly used to visualize simple x, y plots of data for numerical comparisons by partitioning the categorical data values into bars and typically limited to operate on highly aggregated dataset. In today’s growing complexity of business data with multi dimensional attributes using bar chart itself is not sufficient to deal with the representation of such business dataset and it also not utilizes the screen space efficiently.Nevertheless, bar chart is still useful because of its shape create strong visual attention to users at first glance than other visualization techniques. In this article, we present a treemap bar chart + tablelens interaction technique that combines the treemap and bar chart visualizations with a tablelens based zooming technique that allows users to view the detail of a particular bar when the density of bars increases. In our approach, the capability of the original bar chart and treemaps for representing complex business data is enhanced and the utilization of display space is also optimized.}, crossref = {IV2009}, doi = {10.1109/IV.2009.22} } @INPROCEEDINGS{Huang2007, author = {Mao Lin Huang and Quang Vinh Nguyen and Wei Lai and Xiaodi Huang}, title = {Three-Dimensional {EncCon} Tree}, pages = {429--433}, abstract = {This paper describes a three-dimensional extension of a enclosure+connection layout technique, called EncCon tree. The three-dimensional visualization includes layout and navigation. The layout algorithm directly generalizes the two-dimensional EncCon tree layout algorithm to three-dimensional space in which nodes at the same level of the hierarchy are placed onto the same plane. The interactive navigation uses standard three-dimensional viewing techniques which include view transformation, rotation and zoom.}, crossref = {CGIV2007}, doi = {10.1109/CGIV.2007.82} } @INPROCEEDINGS{Ishihara2006, author = {Masaki Ishihara and Kazuo Misue and Jiro Tanaka}, title = {Ripple Presentation for Tree Structures with Historical Information}, pages = {153--160}, abstract = {We propose a new method for representing tree structures with historical information. We call this method Ripple Presentation. Categories of nodes are represented by the angles of edges and elapsed time is represented by the length of the edges. In this way, the method can express both the time series and categories, which has been diffic lt to achieve with either tree structures or lists. As a result, users can nderstand the overall information from their viewpoint view and discover target information effectively. We applied the method to trackback links of Weblog articles and the latest articles of News sites using RSS on Web as a resource.}, crossref = {APVIS2006}, url = {http://portal.acm.org/citation.cfm?id=1151903.1151927} } @INPROCEEDINGS{Jeong1998, author = {Chang-Sung Jeong and Alex Pang}, title = {Reconfigurable Disc Trees for Visualizing Large Hierarchical Information Space}, pages = {19--25}, abstract = {We present a new visualization technique, called RDT (Reconfigurable Disc Tree) which can alleviate the disadvantages of cone trees significantly for large hierarchies while maintaining its context of using 3D depth. In RDT, each node is associated with a disc around which its children are placed. Using discs instead of cones as the basic shape in RDT has several advantages: significant reduction of occluded region, sharp increase in number of displayed nodes, and easy projection onto plane without visual overlapping. We show that RDT can greatly enhance user perception by transforming its shapes dynamically in several ways:(1) disc tree which can significantly reduce the occluded region by the foreground objects, (2) compact disc tree which can increase the number of nodes displayed on the screen, and (3) plane disc tree which can be mapped onto the plane without visual overlapping. We describe an implementation of our visualization system called VISIT (Visual Information System for reconfigurable dIsc Tree). It provides 2D and 3D layouts for RDT and various user interface features such as tree reconfiguration, tree transformation, tree shading, viewing transformation, animation, selection and browsing which can enhance the user perception and navigation capabilities. We also evaluate our system using the following three metrics: percentage of occlusion, density of displayed nodes on a screen. number of identifiable nodes.}, crossref = {INFOVIS1998}, doi = {10.1109/INFVIS.1998.729555} } @INPROCEEDINGS{Johnson1991, author = {Brian Johnson and Ben Shneiderman}, title = {{Tree-Maps}: A space-filling approach to the visualization of hierarchical information structures}, pages = {284--291}, abstract = {A method for visualizing hierarchically structured information is described. The tree-map visualization technique makes 100% use of the available display space, mapping the full hierarchy onto a rectangular region in a space-filling manner. This efficient use of space allows very large hierarchies to be displayed in their entirety and facilitates the presentation of semantic information. Tree-maps can depict both the structure and content of the hierarchy. However, the approach is best suited to hierarchies in which the content of the leaf nodes and the structure of the hierarchy are of primary importance, and the content information associated with internal nodes is largely derived from their children.}, crossref = {VIS1991}, doi = {10.1109/VISUAL.1991.175815} } @INPROCEEDINGS{Kerr2003, author = {Bernard Kerr}, title = {Thread Arcs: an email thread visualization}, pages = {211--218}, abstract = {This paper describes Thread Arcs, a novel interactive visualization technique designed to help people use threads found in email. Thread Arcs combine the chronology of messages with the branching tree structure of a conversational thread in a mixed-model visualization by Venolia and Neustaedter (2003) that is stable and compact. By quickly scanning and interacting with Thread Arcs, people can see various attributes of conversations and find relevant messages in them easily. We tested this technique against other visualization techniques with users' own email in a functional prototype email client. Thread Arcs proved an excellent match for the types of threads found in users' email for the qualities users wanted in small-scale visualizations.}, crossref = {INFOVIS2003}, doi = {10.1109/INFVIS.2003.1249028} } @INPROCEEDINGS{Keskin1997, author = {Can Keskin and Volker Vogelmann}, title = {Effective Visualization of Hierarchical Graphs With the Cityscape Metaphor}, pages = {52--57}, 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 sizes 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.}, crossref = {NPIVM1997}, doi = {10.1145/275519.275531} } @INPROCEEDINGS{Kleiberg2001, author = {Ernst Kleiberg and Huub van de Wetering and Jarke J. van Wijk}, title = {Botanical Visualization of Huge Hierarchies}, pages = {87--94}, abstract = {A new method for the visualization of huge hierarchical data structures is presented. The method is based on the observation that we can easily see the branches, leaves, and their arrangement in a botanical tree, despite of the large number of elements. The strand model of Holton is used to convert an abstract tree into a geometric model. Nonleaf nodes are mapped to branches and child nodes to subbranches. A naive application of this model leads to unsatisfactory results, hence it is tailored to suit our purposes better. Continuing branches are emphasized, long branches are contracted, and sets of leaves are shown as fruit. The method is applied to the visualization of directory structures. The elements, directories and files, as well as their relations can easily be extracted, thereby showing that the use of methods from botanical modeling can be effective for information visualization.}, crossref = {INFOVIS2001} } @INPROCEEDINGS{Kreuseler1999, author = {Matthias Kreuseler and Heidrun Schumann}, title = {Information visualization using a new focus+context technique in combination with dynamic clustering of information space}, pages = {1--5}, abstract = {This paper presents work in progress on our approach to visualizing multi-dimensional and hierarchical information. We propose two new graphical user interfaces, the Magic Eye View (MEV) and ShapeVis to explore information spaces. In order to cope with large information sets we combine MEV and ShapeVis with dynamic hierarchical clustering of information units The Magic Eye View, which implements a new Focus+Context technique, is used as the interface for visualizing those hierarchies. In order to support detailed exploration of the information space (e.g analysis of certain cluster nodes or hierarchy levels) a new technique for visualizing multidimensional information is used. ShapeVis provides 2D or 3D representations of the information objects according to the selected subset of the information space Objects are represented as small closed free-form-surfaces. The location, size and shape of these surfaces describe the original objects in the information space uniquely according to their properties.}, crossref = {NPIV1999}, doi = {10.1145/331770.331772} } @INPROCEEDINGS{Kubota2006, author = {Hidekazu Kubota and Toyoaki Nishida and Yasuyuki Sumi}, title = {Visualization of Contents Archive by Contour Map Representation}, pages = {19--32}, abstract = {This article describes a model for sustainable contents management, its visualization algorithms, and the implemented system, called sustainable knowledge globe (SKG). The focal point of our study is visualization using contour maps. The graphical representation of tree-structured contents increases in complexity with the number of contents. The contour map representations can briefly depict the arrangement and structure of contents in an archive. Three contour map representations are proposed assuming the importance of the arrangement design. Nesting, dendroidal, and island-like contours are amplified from the viewpoint of preservation of the structures and arrangements, in addition to supporting shape and texture design. The comparison and applications of the three algorithms are discussed.}, crossref = {JSAI2006}, doi = {10.1007/978-3-540-69902-6_3} } @INPROCEEDINGS{Lu2008, author = {Hao R. L\"u and James Fogarty}, title = {Cascaded {Treemaps}: Examining the Visibility and Stability of Structure in {Treemaps}}, pages = {259--266}, abstract = {Treemaps are an important and commonly-used approach to hierarchy visualization, but an important limitation of treemaps is the difficulty of discerning the structure of a hierarchy. This paper presents cascaded treemaps, a new approach to treemap presentation that is based in cascaded rectangles instead of the traditional nested rectangles. Cascading uses less space to present the same containment relationship, and the space savings enable a depth effect and natural padding between siblings in complex hierarchies. In addition, we discuss two general limitations of existing treemap layout algorithms: disparities between node weight and relative node size that are introduced by layout algorithms ignoring the space dedicated to presenting internal nodes, and a lack of stability when generating views of different levels of treemaps as a part of supporting interactive zooming. We finally present a two-stage layout process that addresses both concerns, computing a stable structure for the treemap and then using that structure to consider the presentation of internal nodes when arranging the treemap. All of this work is presented in the context of two large real-world hierarchies, the Java package hierarchy and the eBay auction hierarchy.}, crossref = {GI2008}, url = {http://portal.acm.org/citation.cfm?doid=1375714.1375758} } @INPROCEEDINGS{Larrea2007, author = {Martin L. Larrea and Sergio R. Martig and Silvia M. Castro}, title = {Spherical Layout for {3D} Tree Visualization}, pages = {91--98}, abstract = {The 3D tree visualization faces multiples challenges: the election of an appropriate layout, the use of the interactions that make it easier the data exploration and a metaphor that helps the information understanding. A good combination of these three elements (layout, interactions and metaphor) will result in a visualization that effectively convey the key features of a complex structure or system to a wide range of users and permits the analytical reasoning process. The goal of this work was centered in the 3D tree visualization. In spite of their apparent simplicity, the displaying of a tree in 3D can also introduce new problems that can be overcome with the appropriate interactions. So, we have developed a new visualization technique for 3D tree visualization; this includes the design of a new tree layout that we called Spherical layout and the set of interactions that can be applied on this representation. This technique allows representing hierarchical structures to different levels of detail and also can be used as a visualization technique that allows a tree with attribute to be visualized. The Spherical layout has shown good result for large trees without compromising the performance; this is a key issue in tree visualization.}, crossref = {IADIS2007}, url = {http://cs.uns.edu.ar/~mll/site/install/files/papers/othercongrss/IADIS-07-Spherical-Layout-Martin-Larrea-final.pdf} } @INPROCEEDINGS{Lin2005, author = {Chun-Cheng Lin and Hsu-Chun Yen}, title = {On Balloon Drawings of Rooted Trees}, pages = {285--296}, abstract = {Among various styles of tree drawing, balloon drawing, where each subtree is enclosed in a circle, enjoys a desirable feature of displaying tree structures in a rather balanced fashion. We first design an efficient algorithm to optimize angular resolution and aspect ratio for the balloon drawing of rooted unordered trees. For the case of ordered trees for which the center of the enclosing circle of a subtree need not coincide with the root of the subtree, flipping the drawing of a subtree (along the axis from the parent to the root of the subtree) might change both the aspect ratio and the angular resolution of the drawing. We show that optimizing the angular resolution as well as the aspect ratio with respect to this type of rooted ordered trees is reducible to the perfect matching problem for bipartite graphs, which is solvable in polynomial time. Aside from studying balloon drawing from an algorithmic viewpoint, we also propose a local magnetic spring model for producing dynamic balloon drawings with applications to the drawings of galaxy systems, H-trees, and sparse graphs, which are of practical interest.}, crossref = {GD2005}, doi = {10.1007/11618058_26} } @INPROCEEDINGS{Lou2008, author = {Xinghua Lou and Shixia Liu and Tianshu Wang}, title = {{FanLens}: A Visual Toolkit for Dynamically Exploring the Distribution of Hierarchical Attributes}, pages = {151--158}, abstract = {Radial, space-filling visualization is very useful for representing the distribution of attributes in hierarchical data; however it also suffers from its drawbacks in terms of view transition, context preservation, thin slices, flexibility and large sized data support. To address these problems, we propose FanLens, an enhancement upon existing approaches with new features like incremental layout and fisheye distortion based selecting. This visual toolkit also features dynamic hierarchy specification, dynamic visual property mapping, smooth animation, etc. We illustrate the effectiveness of our technique with two examples of case study and results from informal user experiments.}, crossref = {PACIFICVIS2008}, doi = {10.1109/PACIFICVIS.2008.4475471} } @INPROCEEDINGS{Munzner1997, author = {Tamara Munzner}, title = {H3: laying out large directed graphs in {3D} hyperbolic space}, pages = {2--10}, abstract = {We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using traditional techniques for drawing general graphs because we assume a hierarchical nature of the data. We impose a hierarchy on the graph by using domain-specific knowledge to find an appropriate spanning tree. Links which are not part of the spanning tree do not influence the layout but can be selectively drawn by user request. The volume of hyperbolic 3-space increases exponentially, as opposed to the familiar geometric increase of euclidean 3-space. We exploit this exponential amount of room by computing the layout according to the hyperbolic metric. We optimize the cone tree layout algorithm for 3D hyperbolic space by placing children on a hemisphere around the cone mouth instead of on its perimeter. Hyperbolic navigation affords a Focus+Context view of the structure with minimal visual clutter. We have successfully laid out hierarchies of over 20,000 nodes. Our implementation accommodates navigation through graphs too large to be rendered interactively by allowing the user to explicitly prune or expand subtrees.}, crossref = {INFOVIS1997}, doi = {10.1109/INFVIS.1997.636718} } @INPROCEEDINGS{Neumann2006, author = {Petra Neumann and Sheelagh Carpendale and Anand Agarawala}, title = {PhylloTrees: Phyllotactic Patterns for Tree Layout}, pages = {59--66}, abstract = {Motivations for drawing hierarchical structures are probably as diverse as datasets to visualize. This ubiquity of tree structures has lead to a manifold of tree layout algorithms and tree visualization systems. While many tree layouts exist, increasingly massive data sets, expanding computational power, and still relatively limited display space make tree layout algorithms a topic of ongoing interest. We explore the use of nature’s phyllotactic patterns to inform the layout of hierarchical data. These naturally occurring patterns provide a non-overlapping, optimal packing when the total number of nodes is not known a priori. We present PhylloTrees, a family of expandable tree layouts based on these patterns.}, crossref = {EUROVIS2006}, doi = {10.2312/VisSym/EuroVis06/059-066} } @INPROCEEDINGS{Neumann2005, author = {Petra Neumann and Stefan Schlechtweg and Sheelagh Carpendale}, title = {{ArcTrees}: Visualizing Relations in Hierarchical Data}, pages = {53--60}, abstract = {In this paper we present, ARCTREES, a novel way of visualizing hierarchical and non-hierarchical relations within one interactive visualization. Such a visualization is challenging because it must display hierarchical information in a way that the user can keep his or her mental map of the data set and include relational information without causing misinterpretation. We propose a hierarchical view derived from traditional Treemaps and augment this view with an arc diagram to depict relations. In addition, we present interaction methods that allow the exploration of the data set using Focus+Context techniques for navigation. The development was motivated by a need for understanding relations in structured documents but it is also useful in many other application domains such as project management and calendars.}, crossref = {EUROVIS2005}, doi = {10.2312/VisSym/EuroVis05/053-060} } @INPROCEEDINGS{Nguyen2002, author = {Quang Vinh Nguyen and Mao Lin Huang}, title = {A Space-Optimized Tree Visualization}, pages = {85--92}, 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.}, crossref = {INFOVIS2002}, doi = {10.1109/INFVIS.2002.1173152} } @INPROCEEDINGS{Onak2008, author = {Krzysztof Onak and Anastasios Sidiropoulos}, title = {Circular Partitions with Applications to Visualization and Embeddings}, pages = {28--37}, abstract = {We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small aspect ratio, and satisfying specified volume constraints. We apply these partitions to obtain a natural extension of the popular Treemap visualization method. Our proposed algorithm is not constrained in using only rectangles, and can achieve provably better guarantees on the aspect ratio of the constructed polygons. Under relaxed conditions, we can also construct circular partitions in higher-dimensional spaces. We use these relaxed partitions to obtain improved approximation algorithms for embedding ultrametrics into d-dimensional Euclidean space. In particular, we give a polylog(Delta)-approximation algorithm for embedding n-point ultrametrics into R^d with minimum distortion (Delta denotes the spread of the metric). The previously best-known approximation ratio for this problem was polynomial in n. This is the first algorithm for embedding a non-trivial family of weighted graph metrics into a space of constant dimension that achieves polylogarithmic approximation ratio.}, crossref = {SCG2008}, doi = {10.1145/1377676.1377683} } @INPROCEEDINGS{Ong2005, author = {TeongJoo Ong and John J. Leggett and Unil Yun}, title = {Visualizing Hierarchies and Collection Structures with Fractal Trees}, pages = {31--40}, abstract = {This paper addresses the need for better information access to digital library collections. Without proper visualization tools, organizational and structural information is often lost or suppressed by digital library interfaces. We discuss a 2D fractal tree visualization tool that can be used to more accurately present the structure, organization and interrelation of collection metadata.}, crossref = {ENC2005}, doi = {10.1109/ENC.2005.53} } @INPROCEEDINGS{Otjacques2009, author = {Beno\^{\i}t Otjacques and Ma\"{e}l Cornil and Monique Noirhomme and Fernand Feltz}, title = {{CGD} -- A New Algorithm to Optimize Space Occupation in Ellimaps}, pages = {805--818}, abstract = {How to visualize datasets hierarchically structured is a basic issue in information visualization. Compared to the common diagrams based on the nodes-links paradigm (e.g. trees), the enclosure-based methods have shown high potential to represent simultaneously the structure of the hierarchy and the weight of nodes. In addition, these methods often support scalability up to sizes where trees become very complicated to understand. Several approaches belong to this class of visualization methods such as treemaps, ellimaps, circular treemaps or Voronoi treemaps. This paper focuses on the specific case of ellimaps in which the nodes are represented by ellipses nested one into each other. A controlled experiment has previously shown that the initial version of the ellimaps was efficient to support the perception of the dataset structure and was reasonably acceptable for the perception of the node weights. However it suffers from a major drawback in terms of display space occupation. We have tackled this issue and the paper proposes a new algorithm to draw ellimaps. It is based on successive distortions and relocations of the ellipses in order to occupy a larger proportion of the display space than the initial algorithm. A Monte-Carlo simulation has been used to evaluate the filling ratio of the display space in this new approach. The results show a significant improvement of this factor.}, crossref = {INTERACT2009}, doi = {10.1007/978-3-642-03658-3_84} } @INPROCEEDINGS{Otjacques2007, author = {Beno\^{\i}t Otjacques and Monique Noirhomme and Fernand Feltz}, title = {Innovative Visualization Tools to Monitor Scientific Cooperative Activities}, pages = {33--41}, abstract = {This paper describes how information visualization techniques can be used to monitor a web-based collaborative platform and to support workplace awareness by providing a global overview of the activities. An innovative prototype is described. Its originality relies on using some enclosure-based visualization methods in the context of activities monitoring, which is rather unusual. In addition, a new layout is described for representing data trees. The use of the system is illustrated with the case of a EU-funded Network of Excellence.}, crossref = {CDVE2007}, doi = {10.1007/978-3-540-74780-2_4} } @INPROCEEDINGS{Otjacques2007a, author = {Beno\^{\i}t Otjacques and Monique Noirhomme and Xavier Gobert and Pierre Collin and Fernand Feltz}, title = {Visualizing the activity of a web-based collaborative platform}, pages = {251--256}, abstract = {This paper describes a prototype that offers visualization features for monitoring a Web-based collaborative platform. The data displayed supports workplace awareness by providing an overview of the activities carried out on the platform. The prototype focuses on the information structured as hierarchical data. Three views are included: a classic vertical tree, a treemap view and an original new layout called ellimap. The system has been implemented on a real case in the domain of the support to innovation.}, crossref = {IV2007}, doi = {10.1109/IV.2007.137} } @INPROCEEDINGS{Parsia2005, author = {Bijan Parsia and Taowei Wang and Jennifer Golbeck}, title = {Visualizing Web Ontologies with CropCircles}, abstract = {We apply a new visualization for complex heirarchies, CropCircles, to the interactive visualization ofWeb Ontologies and E-Connections of Web Ontologies.}, crossref = {EUSW2005}, url = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-172/enduserSWI_paper05.pdf} } @INPROCEEDINGS{Plaisant2002, author = {Catherine Plaisant and Jesse Grosjean and Benjamin B. Bederson}, title = {{SpaceTree}: Supporting Exploration in Large Node Link Tree, Design Evolution and Empirical Evaluation}, pages = {57--64}, 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.}, crossref = {INFOVIS2002}, doi = {10.1109/INFVIS.2002.1173148} } @INPROCEEDINGS{Rekimoto1993, author = {Jun Rekimoto and Mark Green}, title = {The information cube: Using transparency in {3D} information visualization}, pages = {125--132}, abstract = {In this paper, we propose a new 3D visualization technique for hierarchical information. This technique is based on the nested box metaphor, a familiar concept for any users. By using semi-transparent rendering, the system controls the complexity of the information presented to the user. With several 3D interaction techniques provided by the system, the user can recognize and inspect the information structure intuitively. Normally, the user puts on the VR equipment to use the system, but the system is also accessible through a conventional CRT display.}, crossref = {WITS1993} } @INPROCEEDINGS{Robertson1991, author = {George G. Robertson and Jock D. Mackinlay and Stuart K. Card}, title = {Cone Trees: animated 3D visualizations of hierarchical information}, pages = {189--194}, abstract = {The task of managing and accessing large information spaces is a problem in large scale cognition. Emerging technologies for 3D visualization and interactive animation offer potential solutions to this problem, especially when the structure of the information can be visualized. We describe one of these Information Visualization techniques, called the Cone Tree, which is used for visualizing hierarchical information structures. The hierarchy is presented in 3D to maximize effective use of available screen space and enable visualization of the whole structure. Interactive animation is used to shift some of the user’s cognitive load to the human perceptual system.}, crossref = {CHI1991}, doi = {10.1145/108844.108883} } @INPROCEEDINGS{Schedl2007, author = {Markus Schedl and Peter Knees and Gerhard Widmer and Klaus Seyerlehner and Tim Pohle}, title = {Browsing the Web Using Stacked Three-Dimensional Sunbursts to Visualize Term Co-Occurrences and Multimedia Content}, pages = {2--3}, abstract = {We present a novel visualization approach that extends the Sunburst technique to the third dimension, which allows for encoding additional data in the height of each arc segment. By stacking a number of such 3D-Sunbursts, we build a user interface for browsing collections of web pages. We apply techniques for web content indexing of multimedia data (text, audio, image, video) and text analysis to create a UI where each layer of the Sunburst stack represents a specific multimedia content type. We call this user interface the Co-Occurrence Browser (COB) and demonstrate its usability on a collection of web pages related to music artists.}, crossref = {INFOVISposter2007} } @INPROCEEDINGS{Schreck2006, author = {Tobias Schreck and Daniel Keim and Florian Mansmann}, title = {Regular TreeMap Layouts for Visual Analysis of Hierarchical Data}, abstract = {Hierarchical relationships play an utmost important role in many application domains. The appropriate visualization of hierarchically structured data sets can contribute towards supporting the data analyst in effectively analyzing hierarchic structures using visualization as a user friendly means to communicate information. Information Visualization has contributed a number of useful techniques for visualization of hierarchically structured data sets. Yet, the support for certain regularity requirements as arising from many data element types has to be improved. In this paper, we analyze an existing variant of the popular TreeMap family of hierarchical layout algorithms, and we introduce a novel TreeMap algorithm supporting space efficient layout of hierarchical data sets providing global regular layouts. We detail our algorithm, and we present applications on a real-world data set as well as experiments performed on a synthetic data set, showing its applicability and usefulness.}, crossref = {SCCG2006}, url = {http://kops.ub.uni-konstanz.de/volltexte/2009/6917/} } @INPROCEEDINGS{Schulz2009, author = {Hans-J\"org Schulz and Steffen Hadlak and Heidrun Schumann}, title = {Point-based tree representation: A new approach for large hierarchies}, pages = {81--88}, abstract = {Space-filling layout techniques for tree representations are frequently used when the available screen space is small or the data set is large. In this paper, we propose a new approach to space-filling tree representations, which uses mechanisms from the point-based rendering paradigm. Additionally, helpful interaction techniques that tie in with our layout are presented. We will relate our new technique to established space-filling techniques along the lines of a newly developed classification and also evaluate it numerically using the measures of the Ink-Paper-Ratio and overplotted\%.}, crossref = {PACIFICVIS2009}, doi = {10.1109/PACIFICVIS.2009.4906841} } @INPROCEEDINGS{Song2002, author = {Hongzhi Song and Edwin P. Curran and Roy Sterritt}, title = {{FlexTree}: visualising large quantities of hierarchical information}, abstract = {Visualising large quantities of hierarchical information is a difficult topic in information visualisation and it has been attracting much effort since the emergence of this research area. The paper presents the FlexTree, an approach to visualising, navigating and analysing large hierarchies. It is based on the focus+context technique and combines the power of the histogram with traditional two dimensional (2D) node-link diagrams. This approach maintains the context of a large hierarchy while providing easy and consistent access to details of multiple focal points. Simple aesthetic rules and an interactive design were applied to the system. As a demonstration of the approach a computer file system hierarchy with 6,351 file folders and 130,400 files on a personal computer has been successfully visualised.}, crossref = {SMC2002} } @INPROCEEDINGS{Stasko2000a, author = {John Stasko and Eugene Zhang}, title = {Focus+Context Display and Navigation Techniques for Enhancing Radial, Space-Filling Hierarchy Visualizations}, pages = {57--65}, abstract = {Radial, space-filling visualizations can be useful for depicting information hierarchies, but they suffer from one major problem. As the hierarchy grows in size, many items become small, peripheral slices that are difficult to distinguish. We have developed three visualization/interaction techniques that provide flexible browsing of the display. The techniques allow viewers to examine the small items in detail while providing context within the entire information hierarchy. Additionally, smooth transitions between views help users maintain orientation within the complete information space.}, crossref = {INFOVIS2000}, doi = {10.1109/INFVIS.2000.885091} } @INPROCEEDINGS{Tanaka2003, author = {Yoichi Tanaka and Yoshihiro Okada and Koichi Niijima}, title = {Treecube: Visualization Tool for Browsing {3D} Multimedia Data}, pages = {427--432}, abstract = {This paper proposes a new 3D visualization tool for hierarchical information. A 2D visualization tool for hierarchical information called treemap has already been proposed by Ben Shneiderman, et al. in 1992. In general, hierarchical information is represented as a tree structure. Treemap hierarchically lays out each node as a bounding box, whose size is the same as the specific weight or attribute value of the node. After the original treemap algorithm called slice-and-dice, some extensions to it have been proposed: squarified treemap, ordered treemap and strip treemap. Furthermore, quantum treemap is a quantization version of these extensions. In this paper, the authors propose a new 3D visualization tool for hierarchical information called treecube that can be taken as a 3D extension of treemap. Especially, this paper shows its usefulness for browsing 3D multimedia data, i.e., 2D images, 3D shape models, motion data, etc., originally stored in a file system.}, crossref = {IV2003}, doi = {10.1109/IV.2003.1218020} } @INPROCEEDINGS{Teoh2002, author = {Soon Tee Teoh and Kwan-Liu Ma}, title = {{RINGS}: A Technique for Visualizing Large Hierarchies}, pages = {51--73}, abstract = {We present RINGS, a technique for visualizing large trees. We introduce a new ringed circular layout of nodes to make more efficient use of limited display space. RINGS provides the user with the means to specify areas of primary andsecond ary focus, andis able to show multiple foci without compromising understanding of the graph. The strength of RINGS is its ability to show more area in focus andmore contextual information than existing techniques. We demonstrate the effectiveness of RINGS by applying it to the visualization of a Unix file directory.}, crossref = {GD2002}, doi = {10.1007/3-540-36151-0_25} } @INPROCEEDINGS{Turo1992, author = {David Turo and Brian Johnson}, title = {Improving the visualization of hierarchies with treemaps: Design Issues and Experimentation}, pages = {124--131}, abstract = {Controlled experiments with novice treemap users and real data highlight the strengths of treemaps and provide direction for improvement. Issues discussed include experimental results, layout algorithms, nesting offsets, labeling, animation, and small multiple displays. Treemaps prove to be a potent tool for hierarchy display. The principles discussed are applicable to many information visualization situations.}, crossref = {VIS1992}, doi = {10.1109/VISUAL.1992.235217} } @INPROCEEDINGS{Vernier2002, author = {Frederic Vernier and Neal Lesh and Chia Shen}, title = {Visualization techniques for circular tabletop interfaces}, pages = {257--265}, abstract = {This paper presents visualization and layout schemes developed for a novel circular user interface designed for a round, tabletop display. Since all the displayed items are in a polar coordinate system, many interface and visualization schemes must be revisited to account for this new layout of UI elements. We discuss the direct implications of such a circular interface on document orientation. We describe two types of fisheye deformation of the circular layout and explain how to use them in a multi-person collaborative interface. These two schemes provide a general layout framework for circular interfaces. We have also designed a new visualization technique derived from the particularities of the circular layout we have highlighted. In this technique the user controls the layout of the elements of a hierarchical tree. Our approach is to provide the user rich interaction possibilities to easily and quickly produce a layout comparable to the hyperbolic view developed at Xerox PARC. The visualization work presented in this paper is part of our ongoing Personal Digital Historian (PDH) research project. The overall goal of PDH is to investigate ways to effectively and intuitively organize, navigate, browse, present and visualize digital data in an interactive multi-person conversational setting.}, crossref = {AVI2002}, doi = {10.1145/1556262.1556305} } @INPROCEEDINGS{Vinnik2006, author = {Svetlana Vinnik and Florian Mansmann}, title = {From Analysis to Interactive Exploration: Building Visual Hierarchies from {OLAP} Cubes}, pages = {496--514}, abstract = {We present a novel framework for comprehensive exploration of OLAP data by means of user-defined dynamic hierarchical visualizations. The multidimensional data model behind the OLAP architecture is particularly suitable for sophisticated analysis of large data volumes. However, the ultimate benefit of applying OLAP technology depends on the "intelligence" and usability of visual tools available to end-users. The explorative framework of our proposed interface consists of the navigation structure, a selection of hierarchical visualization techniques, and a set of interaction features. The navigation interface allows users to pursue arbitrary disaggregation paths within single data cubes and, more importantly, across multiple cubes. In the course of interaction, the navigation view adapts itself to display the chosen path and the options valid in the current context. Special effort has been invested in handling non-trivial relationships (e.g., mixed granularity) within hierarchical dimensions in a way transparent to the user. We propose a visual structure called Enhanced Decomposition Tree to to be used along with popular "state-of-the-art" hierarchical visualization techniques. Each level of the tree is produced by a disaggregation step, whereas the nodes display the specified subset of measures, either as plain numbers or as an embedded chart. The proposed technique enables a stepwise descent towards the desired level of detail while preserving the history of the interaction. Aesthetic hierarchical layout of the node-link tree ensures clear structural separation between the analyzed values embedded in the nodes and their dimensional characteristics which label the links. Our framework provides an intuitive and powerful interface for exploring complex multidimensional data sets.}, crossref = {EDBT2006}, doi = {10.1007/11687238_31} } @INPROCEEDINGS{Wang2006, author = {Weixin Wang and Hui Wang and Guozhong Dai and Hongan Wang}, title = {Visualization of Large Hierarchical Data by Circle Packing}, pages = {517--520}, abstract = {In this paper a novel approach is described for tree visualization using nested circles. The brother nodes at the same level are represented by externally tangent circles; the tree nodes at different levels are displayed by using 2D nested circles or 3D nested cylinders. A new layout algorithm for tree structure is described. It provides a good overview for large data sets. It is easy to see all the branches and leaves of the tree. The new method has been applied to the visualization of file systems.}, crossref = {CHI2006}, doi = {10.1145/1124772.1124851} } @INPROCEEDINGS{Wattenberg2005, author = {Martin Wattenberg}, title = {A Note on Space-Filling Visualizations and Space-Filling Curves}, pages = {181--185}, abstract = {A recent line of treemap research has focused on layout algorithms that optimize properties such as stability, preservation of ordering information, and aspect ratio of rectangles. No ideal treemap layout algorithm has been found, and so it is natural to explore layouts that produce non-rectangular regions. This note describes a connection between space-filling visualizations and the mathematics of space-filling curves, and uses that connection to characterize a family of layout algorithms which produce nonrectangular regions but enjoy geometric continuity under changes to the data and legibility even for highly unbalanced trees.}, crossref = {INFOVIS2005}, doi = {10.1109/INFVIS.2005.1532145} } @INPROCEEDINGS{Wijk1999, author = {Jarke J. van Wijk and Huub van de Wetering}, title = {Cushion {Treemaps}: Visualization of Hierarchical Information}, pages = {73--78}, abstract = {A new method is presented for the visualization of hierarchical information, such as directory structures and organization structures. Cushion treemaps inherit the elegance of standard treemaps: compact, space-filling displays of hierarchical information, based on recursive subdivision of a rectangular image space. Intuitive shading is used to provide insight in the hierarchical structure.During the subdivision ridges are added per rectangle, which are rendered with a simple shading model. The result is a surface that consists of recursive cushions. The method is efficient, effective, easy to use and implement, and has a wide applicability.}, crossref = {INFOVIS1999}, doi = {10.1109/INFVIS.1999.801860} } @INPROCEEDINGS{Yang2002, author = {Jing Yang and Matthew O. Ward and Elke A. Rundensteiner}, title = {{InterRing}: An Interactive Tool for Visually Navigating and Manipulating Hierarchical Structures}, pages = {77--84}, 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.}, crossref = {INFOVIS2002}, doi = {10.1109/INFVIS.2002.1173151} } @INPROCEEDINGS{Zhao2005, author = {Shengdong Zhao and Michael J. McGuffin and Mark H. Chignell}, title = {Elastic hierarchies: combining {Treemaps} and node-link diagrams}, pages = {57--64}, abstract = {We investigate the use of elastic hierarchies for representing trees, where a single graphical depiction uses a hybrid mixture, or "interleaving", of more basic forms at different nodes of the tree. In particular, we explore combinations of node link and treemap forms, to combine the space efficiency of treemaps with the structural clarity of node link diagrams. A taxonomy is developed to characterize the design space of such hybrid combinations. A software prototype is described, which we used to explore various techniques for visualizing, browsing and interacting with elastic hierarchies, such as side by side overview and detail views, highlighting and rubber banding across views, visualization of multiple foci, and smooth animations across transitions. The paper concludes with a discussion of the characteristics of elastic hierarchies and suggestions for research on their properties and uses.}, crossref = {INFOVIS2005}, doi = {10.1109/INFVIS.2005.1532129} } @ARTICLE{Andrews2002, author = {Andrews, Keith and Kienreich, Wolfgang and Sabol, Vedran and Becker, Jutta and Droschl, Georg and Kappe, Frank and Granitzer, Michael and Auer, Peter and Tochtermann, Klaus}, title = {The {InfoSky} visual explorer: Exploiting hierarchical structure and document similarities}, journal = {Information Visualization}, year = {2002}, volume = {1}, pages = {166--181}, number = {3/4}, abstract = {InfoSky is a system enabling users to explore large, hierarchically structured document collections. Similar to a real-world telescope, InfoSky employs a planar graphical representation with variable magnification. Documents of similar content are placed close to each other and are visualised as stars, forming clusters with distinct shapes. For greater performance, the hierarchical structure is exploited and force-directed placement is applied recursively at each level on much fewer objects, rather than on the whole corpus. Collections of documents at a particular level in the hierarchy are visualised with bounding polygons using a modified weighted Voronoi diagram. Their area is related to the number of documents contained. Textual labels are displayed dynamically during navigation, adjusting to the visualisation content. Navigation is animated and provides a seamless zooming transition between summary and detail view. Users can map metadata such as document size or age to attributes of the visualisation such as colour and luminance. Queries can be made and matching documents or collections are highlighted. Formative usability testing is ongoing; a small baseline experiment comparing the telescope browser to a tree browser is discussed.}, doi = {10.1057/palgrave.ivs.9500023} } @ARTICLE{Aydin2010, author = {Burcu Aydin and Gabor Pataki and Haonan Wang and Alim Ladha and Elizabeth Bullitt and J.S. Marron}, title = {Visualizing the Structure of Large Trees}, journal = {arXiv.org e-print service}, year = {2010}, volume = {1001.0951v2}, abstract = {This study introduces a new method of visualizing complex tree structured objects. The usefulness of this method is illustrated in the context of detecting unexpected features in a data set of very large trees. The major contribution is a novel two-dimensional graphical representation of each tree, with a covariate coded by color. The motivating data set contains three dimensional representations of brain artery systems of 105 subjects. Due to inaccuracies inherent in the medical imaging techniques, issues with the reconstruction algo- rithms and inconsistencies introduced by manual adjustment, various discrepancies are present in the data. The proposed representation enables quick visual detection of the most common discrepancies. For our driving example, this tool led to the modification of 10% of the artery trees and deletion of 6.7%. The benefits of our cleaning method are demonstrated through a statistical hypothesis test on the effects of aging on vessel structure. The data cleaning resulted in improved significance levels.}, url = {http://arxiv.org/abs/1001.0951v2} } @ARTICLE{Bagheri2005, author = {Alireza Bagheri and Mohammadreza Razzazi}, title = {How to draw free trees inside bounded simple polygons}, journal = {Journal of Universal Computer Science}, year = {2005}, volume = {11}, pages = {804--829}, number = {6}, abstract = {In this paper we investigate polyline grid drawing of free trees on 2D grids which are bounded by simple polygons. We focus on achieving uniform node distribution while we also try to achieve minimum edge crossings. We do not consider achieving symmetry as a mandatory task, but our algorithm can exploit some symmetries present in both the given trees and the given polygons. To our knowledge, our work is the first attempt for developing algorithms that draw graphs on regions which are bounded by simple polygons.}, doi = {10.3217/jucs-011-06-0804} } @MISC{Clark2009, author = {Patterson Clark}, title = {The {Kennedy} Family Tree}, howpublished = {The Washington Post, \url{http://www.washingtonpost.com/wp-dyn/content/graphic/2009/08/12/GR2009081200033.html}}, month = {August}, year = {2009}, note = {retrieved 26-APR-2010} } @ARTICLE{Collins2009a, author = {Christopher Collins and Sheelagh Carpendale and Gerald Penn}, title = {{DocuBurst}: Visualizing Document Content using Language Structure}, journal = {Computer Graphics Forum}, year = {2009}, volume = {28}, pages = {1039-1046}, number = {3}, month = {June}, abstract = {Textual data is at the forefront of information management problems today. One response has been the development of visualizations of text data. These visualizations, commonly based on simple attributes such as relative word frequency, have become increasingly popular tools. We extend this direction, presenting the first visualization of document content which combines word frequency with the human-created structure in lexical databases to create a visualization that also reflects semantic content. DocuBurst is a radial, space-filling layout of hyponymy (the IS-A relation), overlaid with occurrence counts of words in a document of interest to provide visual summaries at varying levels of granularity. Interactive document analysis is supported with geometric and semantic zoom, selectable focus on individual words, and linked access to source text.}, doi = {10.1111/j.1467-8659.2009.01439.x} } @MISC{Eichhorn2006, author = {Elisabeth Eichhorn}, title = {Family tree visualization}, howpublished = {University project ``Information architecture and -visualisation'', \url{http://www.elisabetheichhorn.de/_en/projekte/weiter/stammbaum/stammbaum.html}}, year = {2006}, note = {retrieved 26-APR-2010} } @MISC{Eppstein2009, author = {David Eppstein}, title = {Visualizing {BFS} as a spiral}, howpublished = {\url{http://11011110.livejournal.com/171440.html}}, month = {May}, year = {2009}, note = {retrieved 26-APR-2010} } @ARTICLE{Heard2009, author = {Jeff Heard and William Kaufmann and Xiaojun Guan}, title = {A novel method for large tree visualization}, journal = {Bioinformatics}, year = {2009}, volume = {25}, pages = {557--558}, number = {4}, abstract = {Many genomic and proteomic analyses generate as a result a tree of genes or proteins. These trees are often large (containing tens of thousands of nodes and edges), and need a visualization tool to fully display all the information contained in the tree. Clustering analysis can be performed on these trees to obtain clusters of proteins, and we need an efficient way to visualize the clustering results. We present a novel tree visualization tool to help with such analyses.}, doi = {10.1093/bioinformatics/btn656} } @ARTICLE{Holten2008, author = {Danny Holten and Jarke J. van Wijk}, title = {Visual Comparison of Hierarchically Organized Data}, journal = {Computer Graphics Forum}, year = {2008}, volume = {27}, pages = {759--766}, number = {3}, abstract = {We provide a novel visualization method for the comparison of hierarchically organized data. Our technique visualizes a pair of hierarchies that are to be compared and simultaneously depicts how these hierarchies are related by explicitly visualizing the relations between matching subhierarchies. Elements that are unique to each hierarchy are shown, as well as the way in which hierarchy elements are relocated, split or joined. The relations between hierarchy elements are visualized using Hierarchical Edge Bundles (HEBs). HEBs reduce visual clutter, they visually emphasize the aforementioned splits, joins, and relocations of subhierarchies, and they provide an intuitive way in which users can interact with the relations. The focus throughout this paper is on the comparison of different versions of hierarchically organized software systems, but the technique is applicable to other kinds of hierarchical data as well. Various data sets of actual software systems are used to show how our technique can be employed to easily spot splits, joins, and relocations of elements, how sorting both hierarchies with respect to each other facilitates comparison tasks, and how user interaction is supported.}, doi = {10.1111/j.1467-8659.2008.01205.x} } @ARTICLE{Hong2008, author = {Seok-Hee Hong and Peter Eades}, title = {Drawing Trees Symmetrically in Three Dimensions}, journal = {Algorithmica}, year = {2008}, volume = {36}, pages = {153--178}, number = {2}, month = {March}, abstract = {Symmetric graph drawing enables a clear understanding of the structure of the graph. Previous work on symmetric graph drawing has focused on two dimensions. Symmetry in three dimensions is much richer than that of two dimensions. This is the first paper to extend symmetric graph drawing into three dimensions. More specifically, the paper investigates the problem of drawing trees symmetrically in three dimensions. First, we suggest a model for drawing trees symmetrically in three dimensions. Based on this model, we present a linear time algorithm for finding the maximum number of three-dimensional symmetries in trees. We also present a three-dimensional symmetric drawing algorithm for trees.}, doi = {10.1007/s00453-002-1011-4} } @TECHREPORT{Itoh2002, author = {Takayuki Itoh and Yasumasa Kajinaga and Yuko Ikehata and Yumi Yamaguchi}, title = {Data Jewelry Box: A Graphics Showcase for Large-Scale Hierarchical Data Visualization}, institution = {IBM Research}, year = {2002}, number = {RT0427} } @PHDTHESIS{Johnson1993, author = {Brian Scott Johnson}, title = {Treemaps: Visualizing hierarchical and categorical data}, school = {University of Maryland}, year = {1993}, note = {HCIL-94-04, UMI-94-25057}, abstract = {Treemaps are a graphically based method for the visualization of hierarchical or categorical data spaces. Treemap presentations of data shift mental workload from the cognitive to the perceptual systems, taking advantage of the human visual processing system to increase the bandwidth of the human-computer interface. Efficient use of display space allows for the simultaneous presentation of thousands of data records, as well as facilitating the presentation of semantic information. Treemaps let users see the forest and the trees by providing local detail in the context of a global overview, providing a visually engaging environment in which to analyze, search, explore and manipulate large hierarchical and categorical data spaces. The treemap method of hierarchical visualization, at its core, is based on the property of containment. This property of containment is a fundamental idea which powerfully encapsulates many of our reasons for constructing information hierarchies. All members of the treemap family of algorithms partition multi-dimensional display spaces based on weighted hierarchical data sets. In addition to generating treemaps and standard traditional hierarchical diagrams, the treemap algorithms extend non-hierarchical techniques such as bar and pie charts into the domain of hierarchical presentation. Treemap algorithms can be used to generate bar charts, outlines, traditional 2-D node and link diagrams, pie charts, cone trees, cam trees, drum trees, etc. Generating existing diagrams via treemap transformations is an excercise meant to show the power, ease, and generality with which alternative presentations can be generated from the basic treemap algorithms. Controlled experiments with novice treemap users and real data highlight the strengths of treemaps and provide direction for improvement. Experimental results show that treemaps are a powerful visualization tool for large data sets, significantly reducing user performance times for global comparison tasks. Effective visualizations of large data sets can help users gain insight into relevant features of the data, construct accurate mental models of the information, and locate regions of particular interest. Treemaps are based on simple, fundamental ideas, but they are the building blocks with which an entire world of unique and exciting visualizations can be built.} } @INPROCEEDINGS{Karstens2003, author = {Bernd Karstens and Matthias Kreuseler and Heidrun Schumann}, title = {Visualization of Complex Structures on Mobile Handhelds}, booktitle = {IMC'03: } # PROC # {International Workshop Mobile Computing}, year = {2003}, abstract = {Information Visualization has become an important research topic in Computer Graphics. One key issue of this topic is the visual presentation of intrinsic structures of complex information spaces. Today nearly all approaches of structure visualization are designed for none-mobile devices such as PCs or workstations. However, mobile handhelds have become more popular in recent years, and are increasingly used in different application domains. Limited resources of these devices require new paradigms for information presentation and interaction such as new methods for structure visualization based on new metaphors for efficient screen space usage. This paper describes how recent techniques of structure visualization can be adapted or redesigned for mobile pocket-sized devices.}, url = {http://vcg.informatik.uni-rostock.de/~schumann/papers/2002+/IMC_2003.pdf} } @ARTICLE{Kleiner1981, author = {Beat Kleiner and John A. Hartigan}, title = {Representing Points in Many Dimensions by Trees and Castles}, journal = {Journal of the American Statistical Association}, year = {1981}, volume = {76}, pages = {260--269}, number = {374}, month = {June}, abstract = {A number of points in k dimensions are displayed by associating with each point a symbol: a drawing of a tree or a castle. All symbols have the same structure derived from a hierarchical clustering algorithm applied to the k variables (dimensions) over all points, but their parts are coded according to the coordinates of each individual point. Trees and castles show general size effects, the change of whole clusters of variables from point to point, trends, and outliers. They are especially appropriate for evaluating the clustering of variables and for observing clusters of points. Their major advantage over earlier attempts to represent multivariate observations (such as profiles, stars, faces, boxes, and Andrews's curves) lies in their matching of relationships between variables to relationships between features of the representing symbol. Several examples are given, including one with 48 variables.} } @ARTICLE{Kruskal1983, author = {Joseph B. Kruskal and James M. Landwehr}, title = {Icicle Plot: Better Displays for Hierarchical Clustering}, journal = {The American Statistician}, year = {1983}, volume = {37}, pages = {162--168}, number = {2}, abstract = {An icicle plot is a method for presenting a hierarchical clustering. Compared with other methods of presentation, it is far easier in an icicle plot to read off which objects belong to which clusters, and which objects join or drop out from a cluster as we move up and down the levels of the hierarchy, though these benefits only appear when enough objects are being clustered. Icicle plots are described, and their benefits are illustrated using a clustering of 48 objects.} } @ARTICLE{Lamping1996, author = {Jonh Lamping and Ramana Rao}, title = {The Hyperbolic Browser: A Focus+Context Technique for Visualizing Large Hierarchies}, journal = {Journal of Visual Languages and Computing}, year = {1996}, volume = {7}, pages = {33--55}, number = {1}, month = {March}, abstract = {We present a new focus+context technique based on hyperbolic geometry for visualizing and manipulating large hierarchies. Our technique assigns more display space to a portion of the hierarchy while still embedding it in the context of the entire hierarchy. We lay out the hierarchy in a uniform way on a hyperbolic plane and map this plane onto a display region. The chosen mapping provides a fisheye distortion that supports a smooth blending of focus and context. We have deveoped effective procedures for manipulating the focus using pointer clicks as well as interactive dragging and for smoothly animating transitions across such manipulation. Enhancements to the core mechanisms provide support for multiple foci, control of the tradeoff between node density and node display space, and for visualizing graphs by transforming them into trees.}, doi = {10.1006/jvlc.1996.0003} } @MISC{Martin-Anderson2008, author = {Brandon Martin-Anderson}, title = {Portland area shortest path tree}, howpublished = {\url{http://www.flickr.com/photos/ewedistrict/2730980819/}}, month = {August}, year = {2008}, note = {retrieved 26-APR-2010} } @ARTICLE{Munzner2003, author = {Tamara Munzner and Fran\c{c}ois Guimbreti\'ere and Serdar Tasiran and Li Zhang and Yunhong Zhou}, title = {{TreeJuxtaposer}: scalable tree comparison using Focus+Context with guaranteed visibility}, journal = {ACM Transactions on Graphics}, year = {2003}, volume = {22}, pages = {453--462}, number = {3}, month = {July}, abstract = {Structural comparison of large trees is a difficult task that is only partially supported by current visualization techniques, which are mainly designed for browsing. We present TreeJuxtaposer, a system designed to support the comparison task for large trees of several hundred thousand nodes. We introduce the idea of "guaranteed visibility", where highlighted areas are treated as landmarks that must remain visually apparent at all times. We propose a new methodology for detailed structural comparison between two trees and provide a new nearly-linear algorithm for computing the best corresponding node from one tree to another. In addition, we present a new rectilinear Focus+Context technique for navigation that is well suited to the dynamic linking of side-by-side views while guaranteeing landmark visibility and constant frame rates. These three contributions result in a system delivering a fluid exploration experience that scales both in the size of the dataset and the number of pixels in the display. We have based the design decisions for our system on the needs of a target audience of biologists who must understand the structural details of many phylogenetic, or evolutionary, trees. Our tool is also useful in many other application domains where tree comparison is needed, ranging from network management to call graph optimization to genealogy.}, doi = {10.1145/882262.882291} } @ARTICLE{Nguyen2005, author = {Quang Vinh Nguyen and Mao Lin Huang}, title = {{EncCon}: an approach to constructing interactive visualization of large hierarchical data}, journal = {Information Visualization}, year = {2005}, volume = {4}, pages = {1--21}, number = {1}, abstract = {This paper describes a new technique called EncCon for visualizing and navigating large hierarchical information. This technique consists of two components: visualization and navigation. Visualization uses a fast enclosure+connection method to calculate the geometrical layout for the display of large hierarchies in a two-dimensional space. Our technique uses a rectangular division algorithm for recursively positioning the graph. This visualization aims to maximize the utilization of display space while retaining a good geometrical layout as well as a clear (explicit) presentation of the hierarchical structure of graphs. This paper also presents an experimental evaluation of EncCon's layout algorithm. Besides the layout algorithm, EncCon uses a new focus+context viewing technique for the navigation of large hierarchies. We use the zooming+layering concept to achieve the focus+context viewing, rather than the traditional enlarge+embedded concept, which is used by most of the available focus+context techniques. Technically, it employs semi-transparency to achieve the display of two layers of information in z-coordination at the same visualization. Both context view and detail view are drawn at two separate layers. These layers are then displayed in an overlapped manner at the same physical screen space.}, doi = {10.1057/palgrave.ivs.9500087} } @ARTICLE{Nguyen2003, author = {Quang Vinh Nguyen and Mao Lin Huang}, title = {Space-optimized tree: a connection+enclosure approach for the visualization of large hierarchies}, journal = {Information Visualization}, year = {2003}, volume = {2}, pages = {3--15}, number = {1}, abstract = {This paper describes a new approach, space-optimized tree, for the visualization and navigation of tree-structured relational data. This technique can be used especially for the display of very large hierarchies in a two-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 limited screen resolution. Space-optimized tree is a connection+enclosure visualization approach that recursively positions children of a subtree into polygon areas and still uses a node-link diagram to present the entire hierarchical structure. To be able to handle the navigation of large hierarchies, we use a new hybrid viewing technique that combines two viewing methods, the modified semantic zooming and a focus+context technique. While the semantic zooming technique can enlarge a particular viewing area by filtering out the rest of tree structure from the visualization, the focus+context technique allows the user to interactively focus, view and browse the entire visual structure with a reasonable high-density display.}, doi = {10.1057/palgrave.ivs.9500031} } @MISC{Sandberg2007, author = {Anders Sandberg}, title = {Hilbert Tree of Life}, howpublished = {\url{http://www.flickr.com/photos/arenamontanus/1916189332/in/set-72157594326128194/}}, month = {November}, year = {2007}, note = {retrieved 26-APR-2010} } @ARTICLE{Schulz2010a, author = {Hans-J\"org Schulz and Steffen Hadlak and Heidrun Schumann}, title = {Point-Based Visualization for Large Hierarchies}, journal = {IEEE Transactions on Visualization and Computer Graphics}, note = {to appear}, abstract = {Space-filling layout techniques for tree representations are frequently used when the available screen space is small or the data set is large. In this paper, we propose an efficient approach to space-filling tree representations, which uses mechanisms from the point-based rendering paradigm. We relate this new layout approach to common layout mechanisms and present helpful interaction techniques that tie in with our layout. Additionally, we compare and contrast the new layout with established space-filling techniques in a preliminary user study and along the lines of a numerical evaluation using the measures of the Ink-Paper-Ratio and overplotted\%. The flexibility of the general approach is illustrated by several enhancements of the basic layout, as well as its usage within the context of two software frameworks from different application fields.}, doi = {10.1109/TVCG.2010.89} } @ARTICLE{Schulz2010, author = {Hans-J\"org Schulz and Steffen Hadlak and Heidrun Schumann}, title = {The Design Space of Implicit Hierarchy Visualization: A Survey}, journal = {IEEE Transactions on Visualization and Computer Graphics}, year = {2010}, note = {to appear}, abstract = {Apart from explicit, node-link representations, implicit visualizations and especially the Treemap as their frontrunner have acquired a solid position among the available techniques to visualize hierarchies. Their advantage is an extremely space-efficient graphical representation that does not require explicit drawing of edges. In this paper, we survey the design space for this class of visualization techniques. For that purpose, we first establish the design space along the four axes of dimensionality, edge representation, node representation, and layout by examining most of the existing implicit hierarchy visualization techniques. The survey is completed by an outlook to the so far unexplored regions of the design space by giving a few examples of novel combinations of design parameters. Furthermore, we ensure that our design space is not a mere theoretical construct, but a practically usable tool for rapid visualization development by discussing and presenting a concrete software implementation of the introduced design space.}, doi = {10.1109/TVCG.2010.79} } @PHDTHESIS{Shiloach1976, author = {Yossi Shiloach}, title = {Arrangements of Planar Graphs on the Planar Lattice}, school = {Weizmann Institute of Science}, year = {1976} } @ARTICLE{Shneiderman1992, author = {Ben Shneiderman}, title = {Tree visualization with tree-maps: 2-d space-filling approach}, journal = {ACM Transactions on Graphics}, year = {1992}, volume = {11}, pages = {92--99}, number = {1}, abstract = {This paper presents a novel approach to representing trees that have weights or sizes on the leaf nodes. The 2-d visualization is space filling and the recursive algorithm for generation runs rapidly. It depends on color coding (or shading) of regions and easily provides users with a quick overview that clearly indicates relative sizes of the leaf nodes. Figures 3 and 4 show examples of tree-maps with size coding, as implemented by Brian Johnson on an Apple Macintosh II computer with a high resolution color display. Figure 3 shows fifteen files in four directories at three levels, with nested boxes to show the levels. Figure 4 represents actual disk directories encompassing 850 files at four levels with color coding by file type (text, graphics, applications, etc.). We continue to explore refinements of tree-maps such as alternate layouts, better methods for coping with large ranges of file size, color coding schemes and operations applied to files.}, doi = {10.1145/102377.115768} } @ARTICLE{Song2004, author = {Hongzhi Song and Edwin P. Curran and Roy Sterritt}, title = {Multiple foci visualisation of large hierarchies with {FlexTree}}, journal = {Information Visualization}, year = {2004}, volume = {3}, pages = {19--35}, number = {1}, abstract = {One of the main tasks in information visualisation research is creating visual tools to facilitate human understanding of large and complex information spaces. Hierarchies, being a good mechanism for organising such information, are ubiquitous. Although much research effort has been spent on finding useful representations for hierarchies, visualising large hierarchies is still a difficult topic. One of the difficulties is how to handle the ever increasing scale of hierarchies. Another is how to enable the user to focus on multiple selections of interest while maintaining context. This paper describes a hierarchy visualisation technique called FlexTree to address these problems. It contains some important features that have not been exploited so far. A profile or contour unique to the hierarchy being visualised can be viewed in a bar chart layout. A normalised view of a common attribute of all nodes can be selected by the user. Multiple foci are consistently accessible within a global context through interaction. Furthermore it can handle a large hierarchy that contains 10,000 nodes in a PC environment. This technique has been applied to visualise computer file system structures and decision trees from data mining results. The results from informal user evaluations against these two applications are also presented. User feedback suggests that FlexTree is suitable for visualising large decision trees.}, doi = {10.1057/palgrave.ivs.9500065} } @TECHREPORT{Sun2003, author = {Lisong Sun and Steve Smith and Thomas Preston Caudell}, title = {A Low Complexity Recursive Force-Directed Tree Layout Algorithm Based on the {Lennard-Jones} Potential}, institution = {University of New Mexico}, year = {2003}, number = {EECE-TR-03-001}, abstract = {In this paper, a low complexity force-directed tree layout algorithm based on the Lennard-Jones potential is described. The recursive method lays out sub-trees as small disks contained in their parent disk. Inside each disk, children disks are dynamically laid out using a new force directed simulation. Unlike most other force directed layout methods which run in quadratic time for each simulation step, this algorithm runs in O(n**(m+1)/m) time per each step for a tree with n nodes, depth m and all the nodes having uniform number of children. The layout uses space efficiently and reflects both global structure and local detail. The method supports runtime insertion and deletion. Both operations and the evolving process are rendered with smooth animation to preserve visual continuity. The method could be used to monitor in real time, visualize and analyze a wide variety of data which has a rooted tree structure, e.g. internet hosts could be laid out by domain name (DNS) hierarchies. This paper gives a description of the algorithm, a complexity analysis and an example of how the algorithm is implemented to visualize DNS tree.}, url = {http://www.eece.unm.edu/techreports/trds/eece-tr-03-001.pdf} } @ARTICLE{Tu2007, author = {Ying Tu and Han-Wei Shen}, title = {Visualizing Changes of Hierarchical Data using Treemaps}, journal = {IEEE Transactions on Visualization and Computer Graphics}, year = {2007}, volume = {13}, pages = {1286--1293}, number = {6}, month = {November-December}, abstract = {While the treemap is a popular method for visualizing hierarchical data, it is often difficult for users to track layout and attribute changes when the data evolve over time. When viewing the treemaps side by side or back and forth, there exist several problems that can prevent viewers from performing effective comparisons. Those problems include abrupt layout changes, a lack of prominent visual patterns to represent layouts, and a lack of direct contrast to highlight differences. In this paper, we present strategies to visualize changes of hierarchical data using treemaps. A new treemap layout algorithm is presented to reduce abrupt layout changes and produce consistent visual patterns. Techniques are proposed to effectively visualize the difference and contrast between two treemap snapshots in terms of the map items' colors, sizes, and positions. Experimental data show that our algorithm can achieve a good balance in maintaining a treemap's stability, continuity, readability, and average aspect ratio. A software tool is created to compare treemaps and generate the visualizations. User studies show that the users can better understand the changes in the hierarchy and layout, and more quickly notice the color and size differences using our method.}, doi = {10.1109/TVCG.2007.70529} } @INPROCEEDINGS{Vernier2000, author = {Fr\'ed\'eric Vernier and Laurence Nigay}, title = {Modifiable Treemaps Containing Variable-Shaped Units}, booktitle = {Extended Abstracts of the IEEE Information Visualization 2000}, year = {2000}, abstract = {This paper presents a novel method, for the visualization of hierarchical information such as directory structures or family trees. Our technique is based on nested Treemaps and inherits the main property of the Treemaps: space-filling display of hierarchical information. For each node, our technique allocates a bounding box according to a ratio (height/width) that can be modified by the user according to her/his task. To do so, our algorithm does not apply the slice and dice (top-down) approach of standard Treemaps. Our technique is effective, easy to implement and has a wide applicability. To illustrate its application, we developed a system called PARENT which displays a directory tree. PARENT is tightly coupled with Microsoft Windows Explorer.}, url = {http://iihm.imag.fr/publs/2000/Visu2K_Vernier.pdf} } @ARTICLE{Vliegen2006, author = {Roel Vliegen and Jarke J. van Wijk and Erik-Jan van der Linden}, title = {Visualizing Business Data with Generalized Treemaps}, journal = {IEEE Transactions on Visualization and Computer Graphics}, year = {2006}, volume = {12}, pages = {789--796}, number = {5}, month = {September-October}, abstract = {Business data is often presented using simple business graphics. These familiar visualizations are effective for providing overviews, but fall short for the presentation of large amounts of detailed information. Treemaps can provide such detail, but are often not easy to understand. We present how standard treemap algorithms can be adapted such that the results mimic familiar business graphics. Specifically, we present the use of different layout algorithms per level, a number of variations of the squarified algorithm, the use of variable borders, and the use of non-rectangular shapes. The combined use of these leads to histograms, pie charts and a variety of other styles.}, doi = {10.1109/TVCG.2006.200} } @MASTERSTHESIS{Voigt2001, author = {Denny Voigt}, title = {{WWW}-basierte {D}arstellung komplexer {I}nformationsstrukturen}, school = {University of Rostock}, year = {2001}, month = {July}, url = {http://vcg/assets/publications/theses_mas/DA_Voigt2001.pdf} } @ARTICLE{Walker1990, author = {Walker,II, John Q.}, title = {A node-positioning algorithm for general trees}, journal = {Software -- Practice and Experience}, year = {1990}, volume = {20}, pages = {685--705}, number = {7}, month = {July}, abstract = {Drawing a tree consists of two stages: determining the position of each node, and actually rendering the individuals nodes and interconnecting branches. The algorithm described in this paper is concerned with the first stage: given a list of nodes, an indication of the hierarchical relationship among them, and their shape and size, where should each node be positioned for optimal aesthetic effect? This algorithm determines the positions of the nodes for any arbitrary general tree. It is the most desirable positioning with respect to certain widely-accepted heuristics. The positioning, specified in x, y co-ordinates, minimizes the width of the tree. In a general tree, there is no limit on the number of offspring per node; this contrasts with binary and ternary trees, for example, which are trees with a limit of two and three offspring per node. This algorithm operates in time O(N), where N is the number of nodes in the tree. Previously, most tree drawings have been positioned by the sure hand of a human graphic designer. Many computer-generated positionings have been either trivial or contained irregularities. Earlier work by Wetherell and Shannon1 and Tilford,2 upon which this algorithm builds, failed to position the interior nodes of some trees correctly. The algorithm presented here correctly positions a tree's node using only two passes. It also handles several practical considerations: alternative orientations of the tree, variable node sizes and out-of-bounds conditions. Radack, also building on Tilford's work, has solved this same problem with a different algorithm which makes four passes.}, doi = {10.1002/spe.4380200705} } @ARTICLE{Wattenberg2008, author = {Martin Wattenberg and Fernanda B. Viegas}, title = {The {Word Tree}, an Interactive Visual Concordance}, journal = {IEEE Transactions on Visualization and Computer Graphics}, year = {2008}, volume = {14}, pages = {1221--1228}, number = {6}, month = {November-December}, abstract = {We introduce the Word Tree, a new visualization and information-retrieval technique aimed at text documents. A Word Tree is a graphical version of the traditional "keyword-in-context" method, and enables rapid querying and exploration of bodies of text. In this paper we describe the design of the technique, along with some of the technical issues that arise in its implementation. In addition, we discuss the results of several months of public deployment of word trees on Many Eyes, which provides a window onto the ways in which users obtain value from the visualization.}, doi = {10.1109/TVCG.2008.172} } @MISC{Wetzel2003, author = {Kai Wetzel}, title = {Pebbles -- using Circular Treemaps to visualize disk usage}, howpublished = {\url{http://lip.sourceforge.net/ctreemap.html}}, year = {2003}, note = {retrieved 26-APR-2010}, abstract = {During the 1990s Ben Shneiderman of the Human-Computer Interaction Laboritory (HCIL) of the University of Maryland invented Treemaps as a "compact visualization of directory tree structures". Treemaps involve "turning a tree into a planar space-filling" representation. Unlike other variations such as squarified treemaps, or cushion treemaps, circular treemaps as presented here could be considered an evolutionary dead-end (rejected early by Ben Shneiderman) but at least I think it's a pretty one.} } @ARTICLE{Wood2008, author = {Jo Wood and Jason Dykes}, title = {Spatially Ordered Treemaps}, journal = {IEEE Transactions on Visualization and Computer Graphics}, year = {2008}, volume = {14}, pages = {1348--1355}, number = {6}, abstract = {Existing treemap layout algorithms suffer to some extent from poor or inconsistent mappings between data order and visual ordering in their representation, reducing their cognitive plausibility. While attempts have been made to quantify this mismatch, and algorithms proposed to minimize inconsistency, solutions provided tend to concentrate on one-dimensional ordering. We propose extensions to the existing squarified layout algorithm that exploit the two-dimensional arrangement of treemap nodes more effectively. Our proposed spatial squarified layout algorithm provides a more consistent arrangement of nodes while maintaining low aspect ratios. It is suitable for the arrangement of data with a geographic component and can be used to create tessellated car tograms for geovisualization. Locational consistency is measured and visualized and a number of layout algorithms are compared. CIELab color space and displacement vector overlays are used to assess and emphasize the spatial layout of treemap nodes. A case study involving locations of tagged photographs in the Flickr database is described.}, doi = {10.1109/TVCG.2008.165} } @PROCEEDINGS{INFOVIS2001, title = {IEEE Symposium on Information Visualization, 22-23 October 2001}, year = {2001}, abbrev = {INFOVIS}, booktitle = {InfoVis'01: } # PROC # {IEEE Symposium on Information Visualization}, editor = {Keith Andrews and Steven Roth and Pak Chung Wong}, publisher = {IEEE Computer Society}, location = {San Diego, CA, USA}, isbn = {0769513425} } @PROCEEDINGS{ISVD2009, title = {International Symposium on Voronoi Diagrams, 23-26 June 2009}, year = {2009}, abbrev = {ISVD}, booktitle = {ISVD'09: } # PROC # {International Symposium on Voronoi Diagrams}, editor = {Fran\c{c}ois Anton}, publisher = {IEEE Computer Society}, location = {Copenhagen, Denmark}, isbn = {9780769537818} } @PROCEEDINGS{CGIV2007, title = {Computer Graphics, Imaging and Visualisation, 14-17 August 2007}, year = {2007}, abbrev = {CGIV}, booktitle = {CGIV'07: } # PROC # {Computer Graphics, Imaging and Visualisation}, editor = {Ebad Banissi and Muhammad Sarfraz and Natasha Dejdumrong}, publisher = {IEEE Computer Society}, location = {Bangkok, Thailand}, isbn = {0769529283} } @PROCEEDINGS{IV2009, title = {International Conference on Information Visualisation, 15-17 July 2009}, year = {2009}, abbrev = {IV}, booktitle = {IV'09: } # PROC # {International Conference on Information Visualisation}, editor = {Ebad Banissi and Liz Stuart and Theodor G. Wyeld and Mikael Jern and Gennady Andrienko and Nasrullah Memon and Reda Alhajj and Remo Aslak Burkhard and Georges Grinstein and Dennis Groth and Anna Ursyn and Jimmy Johansson and Camilla Forsell and Urska Cvek and Marjan Trutschi and Francis T. Marchese and Carsten Maple and Andrew J. Cowell and Andrew Vande Moere}, publisher = {IEEE Computer Society}, location = {Barcelona, Spain}, isbn = {9780769537337} } @PROCEEDINGS{GI2008, title = {Graphics Interface, 28-30 May 2008}, year = {2008}, abbrev = {GI}, booktitle = {GI'08: } # PROC # {Graphics Interface Conference}, editor = {Lyn Bartram and Chris Shaw}, publisher = {Canadian Information Processing Society}, location = {Windsor, Ontario, Canada}, isbn = {9781568814230} } @PROCEEDINGS{EUSW2005, title = {ISWC Workshop on End User Semantic Web Interaction, 7 November 2005}, year = {2005}, abbrev = {EUSW}, booktitle = PROC # {ISWC Workshop on End User Semantic Web Interaction 2005}, editor = {Abraham Bernstein and Ion Androutsopoulos and Duane Degler and Brian McBride}, publisher = {CEUR Workshop Proceedings}, location = {Galway, Ireland}, url = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-172/} } @PROCEEDINGS{EUROVIS2005, title = {Joint Eurographics - IEEE VGTC Symposium on Visualization, 1-3 June 2005}, year = {2005}, abbrev = {EUROVIS}, booktitle = {EuroVis'05: } # PROC # {Joint Eurographics - IEEE VGTC Symposium on Visualization}, editor = {Ken Brodlie and David Duke and Kenneth I. Joy}, publisher = {Eurographics Association}, location = {Leeds, UK}, isbn = {3905673193} } @PROCEEDINGS{ISAAC2005, title = {International Symposium on Algorithms and Computations, 19-21 December 2005}, year = {2005}, abbrev = {ISAAC}, booktitle = {ISAAC'05: } # PROC # {International Symposium on Algorithms and Computations}, editor = {Xiaotie Deng and Dingzhu Du}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, location = {Sanya, Hainan, China}, isbn = {9783540309352}, doi = {10.1007/11602613} } @PROCEEDINGS{INFOVIS1997, title = {IEEE Symposium on Information Visualization, 18-25 October 1997}, year = {1997}, abbrev = {INFOVIS}, booktitle = {InfoVis'97: } # PROC # {IEEE Symposium on Information Visualization}, editor = {John Dill and Nahum D. Gershon}, publisher = {IEEE Computer Society}, location = {Phoenix, AZ, USA}, isbn = {0818681896} } @PROCEEDINGS{PACIFICVIS2009, title = {IEEE Pacific Visualization Symposium, 20-23 April 2009}, year = {2009}, abbrev = {PACIFICVIS}, booktitle = {PacificVis'09: } # PROC # {IEEE Pacific Visualization Symposium}, editor = {Peter Eades and Thomas Ertl and Han-Wei Shen}, publisher = {IEEE Computer Society}, location = {Beijing, China}, isbn = {9781424444055} } @PROCEEDINGS{NPIVM1997, title = {Workshop on New Paradigms in Information Visualization and Manipulation, 10-14 November 1997}, year = {1997}, abbrev = {NPIVM}, booktitle = {NPIVM'97: } # PROC # {Workshop on New Paradigms in Information Visualization and Manipulation}, editor = {David S. Ebert and Charles K. Nicholas}, publisher = {ACM Press}, location = {Las Vegas, NV, USA}, isbn = {1581130511} } @PROCEEDINGS{NPIV1999, title = {Workshop on New Paradigms in Information Visualization and Manipulation, 02-06 November 1999}, year = {1999}, abbrev = {NPIV}, booktitle = {NPIV'99: } # PROC # {Workshop on New Paradigms in Information Visualization and Manipulation}, editor = {David S. Ebert and Christopher D. Shaw}, publisher = {ACM Press}, location = {Kansas City, MO, United States} } @PROCEEDINGS{ENC2005, title = {Mexican International Conference on Computer Science, 26-30 September 2005}, year = {2005}, abbrev = {ENC}, booktitle = {ENV'05: } # PROC # {Mexican International Conference on Computer Science}, editor = {Vladimir Estivill-Castro and J. Alfredo Sanchez}, publisher = {IEEE Computer Society}, location = {Puebla, Mexico}, isbn = {0769524540} } @PROCEEDINGS{PACIFICVIS2008, title = {IEEE Pacific Visualization Symposium, 5-7 March 2008}, year = {2008}, abbrev = {PACIFICVIS}, booktitle = {PacificVis'08: } # PROC # {IEEE Pacific Visualization Symposium}, editor = {Issei Fujishiro and Hua Li and Kwan-Liu Ma}, publisher = {IEEE Computer Society}, location = {Kyoto, Japan}, isbn = {9781424419661} } @PROCEEDINGS{AVI2000, title = {Working Conference on Advanced Visual Interfaces, 23-26 May 2000}, year = {2000}, abbrev = {AVI}, booktitle = {AVI'00: } # PROC # {Working Conference on Advanced Visual Interfaces}, editor = {Vito Di Ges\'u and Stefano Levialdi and Laura Tarantino}, publisher = {ACM Press}, location = {Palermo, Italy}, isbn = {1581132522} } @PROCEEDINGS{GD2002, title = {International Symposium on Graph Drawing, 26-28 August 2002}, year = {2002}, abbrev = {GD}, booktitle = {GD'02: } # PROC # {International Symposium on Graph Drawing}, editor = {Michael T. Goodrich and Stephen G. Kobourov}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, location = {Irvine, CA, USA}, isbn = {9783540001584}, doi = {10.1007/3-540-36151-0} } @PROCEEDINGS{CHI2006, title = {SIGCHI Conference on Human Factors in Computing Systems, 22-27 April 2006}, year = {2006}, abbrev = {CHI}, booktitle = {CHI'06: } # PROC # {International Conference on Human Factors in Computing Systems}, editor = {Rebecca Grinter and Thomas Rodden and Paul Aoki and Ed Cutrell and Robin Jeffries and Gary Olson}, publisher = {ACM Press}, location = {Montreal, Quebec, Canada}, isbn = {1595933727} } @PROCEEDINGS{INTERACT2009, title = {IFIP TC13 Conference on Human-Computer Interaction, 24-28 August 2009}, year = {2009}, abbrev = {INTERACT}, booktitle = {INTERACT'09: } # PROC # {IFIP TC13 Conference on Human-Computer Interaction, Part II}, editor = {Tom Gross and Jan Gulliksen and Paula Kotz\'{e} and Lars Oestreicher and Philippe Palanque and Raquel Oliveira Prates and Marco Winckler}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, location = {Uppsala, Sweden}, isbn = {3642036570}, doi = {10.1007/978-3-642-03658-3} } @PROCEEDINGS{GD2005, title = {International Symposium on Graph Drawing, 12-14 September 2005}, year = {2005}, abbrev = {GD}, booktitle = {GD'05: } # PROC # {International Symposium on Graph Drawing}, editor = {Patrick Healy and Nikola S. Nikolov}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, location = {Limerick, Ireland}, isbn = {9783540314257}, doi = {10.1007/11618058} } @PROCEEDINGS{OWLED2009, title = {International Workshop on OWL: Experiences and Directions, 23-24 October 2009}, year = {2009}, abbrev = {OWLED}, booktitle = {OWLED'09: } # PROC # {International Workshop on OWL: Experiences and Directions}, editor = {Rinke Hoekstra and Peter F. Patel-Schneider}, publisher = {CEUR Workshop Proceedings}, location = {Chantilly, VA, USA}, url = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-529/} } @PROCEEDINGS{EDBT2006, title = {International Conference on Extending Database Technology, 26-31 March 2006}, year = {2006}, abbrev = {EDBT}, booktitle = {EDBT'06: } # PROC # {International Conference on Extending Database Technology}, editor = {Yannis Ioannidis and Marc H. Scholl and Joachim W. Schmidt and Florian Matthes and Mike Hatzopoulos and Klemens Boehm and Alfons Kemper and Torsten Grust and Christian Boehm}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, location = {Munich, Germany}, isbn = {9783540329602}, doi = {10.1007/11687238} } @PROCEEDINGS{SMC2002, title = {IEEE International Conference on Systems, Man and Cybernetics, 6-9 October 2002}, year = {2002}, abbrev = {SMC}, booktitle = {SMC'02: } # PROC # {IEEE International Conference on Systems, Man and Cybernetics}, editor = {Abdelkader El Kamel and Khaled Mellouli and Pierre Borne}, publisher = {IEEE Computer Society}, location = {Yasmine Hammamet, Tunisia}, isbn = {0780374371} } @PROCEEDINGS{CHI1998, title = {SIGCHI Conference on Human Factors in Computing Systems, 18-23 April 1998}, year = {1998}, abbrev = {CHI}, booktitle = {CHI'98: } # PROC # {SIGCHI conference on Human Factors in Computing Systems}, editor = {Clare-Marie Karat and Arnold Lund and Jo\"elle Coutaz and John Karat}, publisher = {ACM Press}, location = {Los Angeles, CA, USA}, isbn = {0201309874} } @PROCEEDINGS{VIS1992, title = {IEEE Conference on Visualization, 19-23 October 1992}, year = {1992}, abbrev = {VIS}, booktitle = {Visualization'92: } # PROC # {IEEE Conference on Visualization}, editor = {Arie Kaufman and Gregory M. Nielson}, publisher = {IEEE Computer Society}, location = {Boston, MA, USA}, isbn = {0818628979} } @PROCEEDINGS{INFOVIS1999, title = {IEEE Symposium on Information Visualization, 24-29 October 1999}, year = {1999}, abbrev = {INFOVIS}, booktitle = {InfoVis'99: } # PROC # {IEEE Symposium on Information Visualization}, editor = {Daniel Keim and Graham Wills}, publisher = {IEEE Computer Society}, location = {San Francisco, CA, USA}, isbn = {0769504310} } @PROCEEDINGS{APWEB2009, title = {Joint International Conferences APWeb/WAIM, 2-4 April 2009}, year = {2009}, abbrev = {APWEB}, booktitle = {Advances in Data and Web Management: } # PROC # {Joint International Conferences APWeb/WAIM 2009}, editor = {Qing Li and Ling Feng and Jian Pei and Sean X.Wang and Xiaofang Zhou and Qiao-Ming Zhu}, publisher = {Springer}, location = {Suzhou, China}, isbn = {9783642006715}, doi = {10.1007/978-3-642-00672-2} } @PROCEEDINGS{CDVE2007, title = {International Conference on Cooperative Design, Visualization, and Engineering, 16-20 September 2007}, year = {2007}, abbrev = {CDVE}, booktitle = {CDVE'07: } # PROC # {International Conference on Cooperative Design, Visualization, and Engineering}, editor = {Yuhua Luo}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, location = {Shanghai, China}, isbn = {9783540747796}, doi = {10.1007/978-3-540-74780-2} } @PROCEEDINGS{UIST2001, title = {Annual ACM Symposium on User Interface Software and Technology, 11-14 November 2001}, year = {2001}, abbrev = {UIST}, booktitle = {UIST'01: } # PROC # {Annual ACM Symposium on User Interface Software and Technology}, editor = {Marks, Joe and Mynatt, Elizabeth D.}, publisher = {ACM Press}, location = {Orlando, FL, USA}, isbn = {158113438X} } @PROCEEDINGS{APCHI2004, title = {Asia Pacific Conference on Computer Human Interaction, 29 June - 2 July 2004}, year = {2004}, abbrev = {APCHI}, booktitle = {APHI'04: } # PROC # {Asia Pacific Conference on Computer Human Interaction}, editor = {Masood Masoodian and Steve Jones and Bill Rogers}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, location = {Rotorua, New Zealand}, isbn = {9783540223122}, doi = {10.1007/b98382} } @PROCEEDINGS{APVIS2006, title = {Asia Pacific Symposium on Information Visualization, 1-3 February 2006}, year = {2006}, abbrev = {APVIS}, booktitle = {APVIS'06: } # PROC # {Asia Pacific Symposium on Information Visualization}, editor = {Kazuo Misue and Kozo Sugiyama and Jiro Tanaka}, publisher = {Australian Computer Society}, series = {Conference in Research and Practice in Information Technology}, location = {Tokyo, Japan}, isbn = {1920682414} } @PROCEEDINGS{INFOVIS2003, title = {IEEE Symposium on Information Visualization, 20-21 October 2003}, year = {2003}, abbrev = {INFOVIS}, booktitle = {InfoVis'03: } # PROC # {IEEE Symposium on Information Visualization}, editor = {Tamara Munzner and Stephen North}, publisher = {IEEE Computer Society}, location = {Seattle, WA, USA}, isbn = {0780381548} } @PROCEEDINGS{VIS1991, title = {IEEE Conference on Visualization, 22-25 October 1991}, year = {1991}, abbrev = {VIS}, booktitle = {Visualization'91: } # PROC # {IEEE Conference on Visualization}, editor = {Gregory M. Nielson and Larry Rosenblum}, publisher = {IEEE Computer Society}, location = {San Diego, CA, USA}, isbn = {0818622458} } @PROCEEDINGS{IWPSE2007, title = {International workshop on Principles of Software Evolution, 3-4 September 2007}, year = {2007}, abbrev = {IWPSE}, booktitle = {IWPSE'07: } # PROC # {International workshop on Principles of Software Evolution}, editor = {Massimiliano Di Penta and Michele Lanza}, publisher = {ACM Press}, location = {Dubrovnik, Croatia}, isbn = {9781595937223} } @PROCEEDINGS{VISUAL2007, title = {International Conference on Visual Information Systems, 28-29 June 2007}, year = {2007}, abbrev = {VISUAL}, booktitle = {VISUAL'07: Advances in Visual Information Systems}, editor = {Guoping Qiu and Clement Leung and Xiangyang Xue and Robert Laurini}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, location = {Shanghai, China}, isbn = {9783540764137}, doi = {10.1007/978-3-540-76414-4} } @PROCEEDINGS{IADIS2007, title = {International Conference on Interfaces and Human Computer Interaction, 6-8 July 2007}, year = {2007}, abbrev = {IADIS}, booktitle = {IADIS'07: } # PROC # {International Conference on Interfaces and Human Computer Interaction}, editor = {Antonio Palma dos Reis and Katherine Blashki and Yingcai Xiao}, publisher = {IADIS Press}, location = {Lisbon, Portugal} } @PROCEEDINGS{CHI1991, title = {SIGCHI Conference on Human Factors in Computing Systems, 27 April-02 May 1991}, year = {1991}, abbrev = {CHI}, booktitle = {CHI'91: } # PROC # {SIGCHI conference on Human Factors in Computing Systems}, editor = {Scott P. Robertson and Gary M. Olson and Judith S. Olson}, publisher = {ACM Press}, location = {New Orleans, LA, United States}, isbn = {0897913833} } @PROCEEDINGS{EUROVIS2006, title = {Joint Eurographics - IEEE VGTC Symposium on Visualization, 8-10 May 2006}, year = {2006}, abbrev = {EUROVIS}, booktitle = {EuroVis'06: } # PROC # {Joint Eurographics - IEEE VGTC Symposium on Visualization}, editor = {Beatriz Sousa Santos and Thomas Ertl and Kenneth I. Joy}, publisher = {Eurographics Association}, location = {Lisbon, Portugal}, isbn = {3905673312} } @PROCEEDINGS{SCCG2006, title = {Spring Conference on Computer Graphics, 20-22 April 2006}, year = {2006}, abbrev = {SCCG}, booktitle = {SCCG'06: } # PROC # {Spring Conference on Computer Graphics}, editor = {Pavel Slav\'{\i}k}, publisher = {Comenius University, Bratislava}, location = {Casta Papiernicka, Slovak Republic}, isbn = {8022321753} } @PROCEEDINGS{INFOVIS2005, title = {IEEE Symposium on Information Visualization, 23-25 October 2005}, year = {2005}, abbrev = {INFOVIS}, booktitle = {InfoVis'05: } # PROC # {IEEE Symposium on Information Visualization}, editor = {John Stasko and Matthew O. Ward}, publisher = {IEEE Computer Society}, location = {Minneapolis, MN, USA}, isbn = {078039464X} } @PROCEEDINGS{JSAI2006, title = {Japanese Society for Artificial Intelligence Conference and Workshops, 5-9 June 2006}, year = {2006}, abbrev = {JSAI}, booktitle = {New Frontiers in Artificial Intelligence: } # PROC # {Japanese Society for Artificial Intelligence Conference and Workshops}, editor = {Takashi Washio and Ken Satoh and Hideaki Takeda and Akihiro Inokuchi}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, location = {Tokyo, Japan}, isbn = {9783540699019}, doi = {10.1007/978-3-540-69902-6} } @PROCEEDINGS{INFOVIS1998, title = {IEEE Symposium on Information Visualization, 19-20 October 1998}, year = {1998}, abbrev = {INFOVIS}, booktitle = {InfoVis'98: } # PROC # {IEEE Symposium on Information Visualization}, editor = {Graham Wills and John Dill}, publisher = {IEEE Computer Society}, location = {Research Triangle Park, NC, USA}, isbn = {0818690933} } @PROCEEDINGS{ICCVG2004, title = {International Conference on Computer Vision and Graphics, 22-24 September 2004}, year = {2004}, abbrev = {ICCVG}, booktitle = {ICCVG'04: } # PROC # {International Conference on Computer Vision and Graphics}, editor = {Konrad Wojciechowski and Bogdan Smolka and Henryk Palus and Ryszard Kozera and Wladyslaw Skarbek and Lyle Noakes}, publisher = {Springer}, location = {Warsaw, Poland}, isbn = {9781402041785}, doi = {10.1007/1-4020-4179-9} } @PROCEEDINGS{INFOVIS2002, title = {IEEE Symposium on Information Visualization, 27 October - 1 November 2002}, year = {2002}, abbrev = {INFOVIS}, booktitle = {InfoVis'02: } # PROC # {IEEE Symposium on Information Visualization}, editor = {Pak Chung Wong and Keith Andrews}, publisher = {IEEE Computer Society}, location = {Boston, MA, USA}, isbn = {076951751X} } @PROCEEDINGS{VIS1997, title = {IEEE Conference on Visualization, 18-24 October 1997}, year = {1997}, abbrev = {VIS}, booktitle = {Visualization'97: } # PROC # {IEEE Conference on Visualization}, editor = {Roni Yagel and Hans Hagen}, publisher = {ACM Press}, location = {Phoenix, AZ, USA}, isbn = {1581130112} } @PROCEEDINGS{VIS1996, title = {IEEE Conference on Visualization, 27 October - 1 November 1996}, year = {1996}, abbrev = {VIS}, booktitle = {Visualization'96: } # PROC # {IEEE Conference on Visualization}, editor = {Roni Yagel and Gregory M. Nielson}, publisher = {ACM Press}, location = {San Francisco, CA, USA}, isbn = {0897918649} } @PROCEEDINGS{FHTW2008, title = {Workshop on Technology for Family History and Genealogical Research}, year = {2008}, abbrev = {FHTW}, booktitle = {FHTW'08: } # PROC # {Workshop on Technology for Family History and Genealogical Research} } @PROCEEDINGS{SCG2008, title = {Symposium on Computational Geometry, 9-11 June 2008}, year = {2008}, abbrev = {SCG}, booktitle = {SCG'08: } # PROC # {Symposium on Computational Geometry}, publisher = {ACM Press}, location = {College Park, MD, USA}, isbn = {9781605580715} } @PROCEEDINGS{INFOVISposter2007, title = {IEEE Information Visualization Conference, 28-30 October 2007}, year = {2007}, abbrev = {INFOVISposter}, booktitle = {InfoVis'07: Poster Compendium of the IEEE Conference on Information Visualization}, location = {Sacramento, CA, USA} } @PROCEEDINGS{IV2007, title = {International Conference on Information Visualisation, 2-6 July 2007}, year = {2007}, abbrev = {IV}, booktitle = {IV'07: } # PROC # {International Conference on Information Visualisation}, publisher = {IEEE Computer Society}, location = {Z\"urich, Switzerland}, isbn = {0769529003} } @PROCEEDINGS{VISposter2004, title = {IEEE Conference on Visualization, 10-15 October 2004}, year = {2004}, abbrev = {VISposter}, booktitle = {Visualization'04: Poster Compendium of the IEEE Conference on Visualization}, location = {Austin, TX, USA} } @PROCEEDINGS{INFOVISposter2003, title = {IEEE Symposium on Information Visualization, 20-21 October 2003}, year = {2003}, abbrev = {INFOVISposter}, booktitle = {InfoVis'03: Poster Compendium of the IEEE Symposium on Information Visualization}, location = {Seattle, WA, USA} } @PROCEEDINGS{IV2003, title = {International Conference on Information Visualisation, 16-18 July 2003}, year = {2003}, abbrev = {IV}, booktitle = {IV'03: } # PROC # {International Conference on Information Visualisation}, publisher = {IEEE Computer Society}, location = {London, UK}, isbn = {0769519881} } @PROCEEDINGS{AVI2002, title = {Working Conference on Advanced Visual Interfaces, 22-24 May 2002}, year = {2002}, abbrev = {AVI}, booktitle = {AVI'02: } # PROC # {Working Conference on Advanced Visual Interfaces}, publisher = {ACM Press}, location = {Trento, Italy}, isbn = {1581135378} } @PROCEEDINGS{INFOVIS2000, title = {IEEE Symposium on Information Visualization, 9-10 October 2000}, year = {2000}, abbrev = {INFOVIS}, booktitle = {InfoVis'00: } # PROC # {IEEE Symposium on Information Visualization}, publisher = {IEEE Computer Society}, location = {Salt Lake City, UT, USA}, isbn = {0769508049} } @PROCEEDINGS{SOFTVIS1999, title = {Software Visualisation Workshop, 3-4 December 1999}, year = {1999}, abbrev = {SOFTVIS}, booktitle = {SoftVis'99: } # PROC # {Software Visualisation Workshop}, location = {Sydney, Australia} } @PROCEEDINGS{WITS1993, title = {Workshop on Information Technology and Systems, 4-5 December 1993}, year = {1993}, abbrev = {WITS}, booktitle = {WITS'93: } # PROC # {Workshop on Information Technology and Systems}, location = {Orlando, FL, USA} }