Quad general tree drawing algorithm and general trees characterization: towards an environment for the experimental study on general tree drawing algorithms

Information visualization produces (interactive) visual representations of abstract data to reinforce human cognition and perception; thus enabling the viewer to gain knowledge about the internal structure of the data and causal relationships in it. The visualization of information hierarchies is concerned with the presentation of abstract hierarchical information about relationships between various entities. It has many applications in diverse domains such as software engineering, information systems, biology, and chemistry. Information hierarchies are typically modeled by an abstract tree, where vertices are entities and edges represent relationships between entities. The aim of visualizing tree drawings is to automatically produce drawings of trees which clearly reflect the relationships of the information hierarchy. This thesis is primarily concerned with introducing the new general tree drawing algorithm Quad that produces good visually distinguishable angles, and a characterization of general trees which allows us to classify general trees into several types based on their characteristics. Both of these topics are part of building an experimental study environment for the evaluation of drawing algorithms for general trees. The main achievements of this thesis include: 1. A study on characterization of general trees that aims to classify them into several types. 2. A tree drawing algorithm that produces visually distinguishable angles for high degree general trees with user specified angular coefficient

The Perception of Graph Properties In Graph Layouts

abstract: When looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms relate to a user’s ability to perceive graph properties for a given graph layout. This study applies previously established methodologies for perceptual analysis to identify which graph drawing layout will help the user best perceive a particular graph property. A large scale (n = 588) crowdsourced experiment is conducted to investigate whether the perception of two graph properties (graph density and average local clustering coefficient) can be modeled using Weber’s law. Three graph layout algorithms from three representative classes (Force Directed - FD, Circular, and Multi-Dimensional Scaling - MDS) are studied, and the results of this experiment establish the precision of judgment for these graph layouts and properties. The findings demonstrate that the perception of graph density can be modeled with Weber’s law. Furthermore, the perception of the average clustering coefficient can be modeled as an inverse of Weber’s law, and the MDS layout showed a significantly different precision of judgment than the FD layout.Dissertation/ThesisMasters Thesis Computer Science 201

Interactive visualization of information hierarchies and applications on the web

The visualization of information hierarchies is concerned with the presentation of abstract hierarchical information about relationships between various entities. It has many applications in diverse domains such as software engineering, information systems, biology, and chemistry. Information hierarchies are typically modeled by an abstract tree, where vertices are entities and edges represent relationships between entities. The aim of visualizing tree drawings is to automatically produce drawings of trees which clearly reflect the relationships of the information hierarchy. This thesis is primarily concerned with problems related to the automatic generation of area-efficient grid drawings of trees, interactively visualizing information hierarchies, and applying our techniques on Web data. The main achievements of this thesis include: 1. An experimental study on algorithms that produce planar straight-line grid drawings of binary trees, 2. An experimental study that shows the algorithm for producing planar straight-line grid drawings of degree-d trees with n nodes with optimal linear area and with user-defined arbitrary aspect ratio, works well in practice, 3. A rings-based technique for interactively visualizing information hierarchies, in real-time, 4. A survey of Web visualization systems developed to address the lost in cyberspace problem, 5. A separation-based Web visualization system that we present as a viable solution to the lost in cyberspace problem, 6. A rings-based Web visualization system that we propose as a solution to the lost in cyberspace problem