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 15 of 15 for “"graph drawings"”.

  1. Morphing Parallel Graph Drawings

    A pair of straight-line drawings of a graph is called parallel if, for every edge of the graph, the line segment that represents the edge in one drawing is parallel with the line segment that represents the edge in the other drawing. We study the problem of morphing between pairs of parallel planar …

    waterloo Repository record for Morphing Parallel Graph Drawings (opens in a new tab)

  2. Displaying cliques in graph drawings

    Relational information represented by graphs can be found in various areas. Understanding completely connected groups of items is useful in studying relational information. However, when displayed in the form of a graph drawing, completely connected graphs contain quadratically many edges relative …

    sask Repository record for Displaying cliques in graph drawings (opens in a new tab)

  3. Visualizing three-dimensional graph drawings

    … GLuskap system for interactive three-dimensional graph drawing applies techniques of scientific visualization and interactive systems to the construction, display, and analysis of graph drawings. Important features of the system include support for large-screen stereographic 3D display with …

    lethbridge Repository record for Visualizing three-dimensional graph drawings (opens in a new tab)

  4. A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings

    In this thesis, we study drawings of maximal outerplanar graphs that place vertices on integer coordinates. We introduce a new class of graphs, called umbrellas, and a new method of splitting maximal outerplanar graphs into systems of umbrellas. By doing so, we generate a new graph parameter, …

    waterloo Repository record for A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings (opens in a new tab)

  5. Geometric Representations of Graphs: Theory and Application

    Graph Drawing is a field of research that has application in any field of science that needs to visualize binary relations. This thesis covers various problems arising when drawing graphs, both in theoretical and applied settings. In the first and more theory-based part, we start by discussing how …

    wurz-thes Repository record for Geometric Representations of Graphs: Theory and Application (opens in a new tab)

  6. Force-Directed Graph Drawing and Aesthetics Measurement in a Non-Strict Pure Functional Programming Language

    … of non-strict evaluation and immutable state. Graph drawing algorithms, while numerous and broadly studied, have no presence in the non-strict pure functional programming model. Additionally, there is currently no freely licensed standalone toolkit used to quantitatively analyze aesthetics of …

    unt Repository record for Force-Directed Graph Drawing and Aesthetics Measurement in a Non-Strict Pure Functional Programming Language (opens in a new tab)

  7. Algorithms for Drawing Graphs and Polylines with Straight-Line Segments

    Graphs provide a key means to model relationships between entities. They consist of vertices representing the entities, and edges representing relationships between pairs of entities. To make people conceive the structure of a graph, it is almost inevitable to visualize the graph. We call such a …

    wurz-thes Repository record for Algorithms for Drawing Graphs and Polylines with Straight-Line Segments (opens in a new tab)

  8. Angular Schematization in Graph Drawing

    Graphs are a frequently used tool to model relationships among entities. A graph is a binary relation between objects, that is, it consists of a set of objects (vertices) and a set of pairs of objects (edges). Networks are common examples of modeling data as a graph. For example, relationships …

    wurz-thes Repository record for Angular Schematization in Graph Drawing (opens in a new tab)

  9. Graph Morphing via Orthogonal Box Drawings

    Abstract: A graph is a set of vertices, with some pairwise connections given by a set of edges. A graph drawing, such as a node-link diagram, visualizes a graph with geometric features. One of the most common forms of a graph drawings are straight-line point drawings, which represent each vertex …

    waterloo Repository record for Graph Morphing via Orthogonal Box Drawings (opens in a new tab)

  10. Simple Drawings of Kn from Rotation Systems

    … for i∈[n]. If D is a drawing of a labelled graph, then a rotation at vertex v is the cyclic ordering of the edges at v. In particular, the collection of all vertex rotations of a simple drawing of Kn is a complete rotation system. Can we characterize when a complete rotation system can be …

    waterloo Repository record for Simple Drawings of Kn from Rotation Systems (opens in a new tab)

  11. Design and Evaluation of Visual Summaries to Improve Readability of Large Network Visualizations

    … visualizations are increasingly appearing in infographics and documents intended for non-specialist readers. This necessitates understanding how these visualizations are perceived by end users who are not necessarily domain experts, and determining how visual summaries can be provided to ensure …

    sask Repository record for Design and Evaluation of Visual Summaries to Improve Readability of Large Network Visualizations (opens in a new tab)

  12. Straight Line Movement in Morphing and Pursuit Evasion

    … the game when the players move on the visibility graph of a simple polygon. We prove this by showing that the visibility graph of a simple polygon is “dismantlable” (the known class of cop-win graphs). Polygon visibility graphs are also shown to be 2-dismantlable. Two other settings of the game …

    waterloo Repository record for Straight Line Movement in Morphing and Pursuit Evasion (opens in a new tab)

  13. Visual Analysis of Form and Function in Computational Biology

    … is presented that generates (outer-)planar graph drawings for all RNA secondary structure predictions. Previously presented algorithms failed in always producing crossing-free graphs. First, several drawing constraints were derived from the literature. Based on these, the algorithm RNAturtle …

    qucosa-diss

  14. Visual Analysis of Form and Function in Computational Biology

    … is presented that generates (outer-)planar graph drawings for all RNA secondary structure predictions. Previously presented algorithms failed in always producing crossing-free graphs. First, several drawing constraints were derived from the literature. Based on these, the algorithm RNAturtle …

    qucosa-diss