Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 23 for “"Graph drawing"”.
-
Dynamic multilevel graph layout and visualisation
… thesis addresses the issue of efficient dynamic graph drawing for large scale connected graphs with around 10,000 vertices. It contains three main contributions. Firstly, an efficient method for approximating the n-body calculations used in Force Directed Placement (FDP) is described, exploiting …
-
Stochastic Methods for One-Sided Bipartite Crossing Minimization and its Variants
The one-sided bipartite graph drawing problem has been extensively studied in the graph drawing literature, with numerous papers appearing over the years showing novel algorithms and heuristics for minimizing associated edge crossings. Although stochastic methods have been highly successful when …
-
Three-dimensional visualization of multi-layered graphs with application to communications
This thesis introduces two new algorithms for 3D graph drawing and network display. The first algorithm, the Incremental Projection Algorithm , is a new universal algorithm for displaying any graph of any vertex degree. The above algorithm can be implemented to display graph in 3D space without …
-
A framework for visualizing hardness reductions to grid-based games
… first converts the input problem instance into a graph, then draws the graph in an integer grid (a kind of orthogonal graph drawing problem), and finally replaces nodes and edges in this layout with gadgets. To ensure that the final output is aligned, we use linear programming to constrain how …
-
Perpetual exploration of relational information and enhanced star glyphs for multi-source data visualization
… visualization to the display of directed graphs and to the display of multivariate data for analysis. Two novel applications will be presented that are both advancements in the field of information visualization. The first application applies to the visualization and navigation of large or …
-
Optical Graph Recognition
Graphs are an important model for the representation of structural information between objects. One identifies objects and nodes as well as a binary relation between objects and edges. Graphs have many uses, e. g., in social sciences, life sciences and engineering. There are two primary …
-
Visualizing graphs with distinguishable edges and ordered binary trees in small area
As graph layouts and visualizations have been at the forefront of graph drawing research for decades, it consequently led to aesthetic heuristics that not only generated better visualizations and aesthetically appealing graphs but also improved readability and understanding of the graphs. A variety …
-
Localization and sensing applications in the Pushpin Computer Network
… optimization techniques, namely spectral graph drawing and mesh relaxation. In both cases, localization is accomplished by generating distance constraints based on ultrasound time-of-flight measurements to distinct, global sensor stimuli. These distance constraints alone are sufficient to …
-
Einbettung und Charakterisierung von aligned bar 1-visibility Graphen und outer fan free Graphen
… Arbeit werden drei verschiedene Klassen von Graphen untersucht. Die Klassen sind die bar (1;1)-visibilty Graphen, die aligned bar 1-visibility Graphen und die outer fan free Graphen. Die Klassen werden durch ihre möglichen Einbettungen charakterisiert. Die Repräsentation der bar (1; …
-
The book embedding of ordered sets
… problems in different areas can be expressed as graph layout problems whose objective is to determine a linear layout in such way that a certain objective cost is optimized. In a book embedding for an ordered set, the elements are embedded on the spine of the book to form a linear extension. The …
-
Tangram treemaps : an enclosure geometrical partitioning method with various shapes
… datasets; we evaluate the method according to graph drawing and perceptual guidelines to show the advantage in scientific measurements; we conduct three user studies to compare the performance of our method with the traditional treemaps. Research results have proven that Tangram Treemaps could …
-
Cyclic Level Drawings of Directed Graphs
… 1981 is one of the most important algorithms in graph drawing and is widely used for visualizing directed graphs. In its common version, it draws graphs hierarchically and, hence, maps the topological direction to a geometric direction. However, such a hierarchical layout is not possible if the …
-
Drawing algorithms for survivable telecommunication networks.
… networks, we provide three techniques for drawing a ring cover: the inside drawing, the outside drawing and the mixed drawing. In chapter 1, we will introduce the problem and present some basic definitions related to our subject. In chapter 2, we will present the inside drawing algorithm …
-
Geometric Graph Theory and Wireless Sensor Networks
… topology of the sensors is their visibility graph. Using a standard distributed algorithm, the sensors can build common knowledge of their network topology.</p> <p>We first study the following inverse visibility problem: What positions of sensors and obstacles define the computed visibility …
-
Interactive visualization of the collaborative research network
… a large scale dataset known as the Digital Bibliography and Library Project or DBLP, which contains information on all publications that have been published in computer and information science related journals and conference proceedings. We model the DBLP dataset as a social network of research …
-
Optimization of parallel coordinates for visual analytics
… We apply Sugiyama’s layered directed graph drawing algorithm into parallel coordinate plot to minimize the number of edge crossing among polygonal lines. The methods are proved to be valuable as it can optimize the order of missing or non-numerical value to tackle clutter reduction. In …
-
Mixed-Initiative Methods for Following Design Guidelines in Creative Tasks
… I first implemented a system called GraphSpace. It fosters online collaboration by allowing users to store, organize, explore, lay out, and share networks on a web platform. I then used GraphSpace as the infrastructure to support a novel mixed-initiative crowd-algorithm approach for …
-
Constrained Planarity Algorithms in Theory and Practice
… constrained planarity setting, we ask whether a graph admits a crossing-free drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level Planarity, where vertices have to lie on given horizontal lines …
-
Data mining and graph theory focused solutions to Smart Grid challenges
… the effectiveness of data mining and graph theory in solving some of these problems is the motivation of this dissertation. One of the key challenges in taking advantage of what the Smart Grid offers is to extract information from volumes of power system data accumulated by a suite of …
-
Spectral Geometry for Structural Pattern Recognition
Graphs are used pervasively in computer science as representations of data with a network or relational structure, where the graph structure provides a flexible representation such that there is no fixed dimensionality for objects. However, the analysis of data in this form has proved an elusive …
Page 1 of 2