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 89 for “"Graph drawing"”.

  1. 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)

  2. Facets of Planar Graph Drawing

    This thesis makes a contribution to the field of Graph Drawing, with a focus on the planarity drawing convention. The following three problems are considered. (1) Ordered Level Planarity: We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that …

    fu-berlin Repository record for Facets of Planar Graph Drawing (opens in a new tab)

  3. Crossings, Curves, and Constraints in Graph Drawing

    … problems, data, or information can be modeled as graphs. Graphs can be used as a tool for modeling in any case where connections between distinguishable objects occur. Any graph consists of a set of objects, called vertices, and a set of connections, called edges, such that any edge connects a …

    wurz-thes Repository record for Crossings, Curves, and Constraints in Graph Drawing (opens in a new tab)

  4. A Method for Graph Drawing Utilising Patterns

    … a novel method for the layout of undirected graphs. It works by identifying certain patterns within the graph and drawing these in a consistent manner. For graphs to be useful and of benefit to a user, the result must clear and easy to understand. This process attempts to draw graphs in such …

    kent Download PDF for A Method for Graph Drawing Utilising Patterns (opens in a new tab)

  5. Graph drawing strategies for large UML State Machine diagrams

    … of their parts. This report describes how two graph drawing strategies can improve the depictions of UML state machines from a particular business case. The intention is to show new options to improve the readability and overall quality of the outcome produced by an in-house graph drawing …

    chalmers Repository record for Graph drawing strategies for large UML State Machine diagrams (opens in a new tab)

  6. Adaptive Force-Directed Graph Drawing: Structure-Aware Methods and Reinforcement Learning-Based Parameter Control

    Force-directed graph drawing provides a flexible approach to graph visualization, but layout quality can depend on graph structure and on how the layout process is configured during refinement. This thesis investigates two complementary approaches to adaptive force-directed drawing. The first …

    brock Repository record for Adaptive Force-Directed Graph Drawing: Structure-Aware Methods and Reinforcement Learning-Based Parameter Control (opens in a new tab)

  7. 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)

  8. 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 …

    greenwich Download PDF for Dynamic multilevel graph layout and visualisation (opens in a new tab)

  9. 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)

  10. Optimizing Crossings in Circular-Arc Drawings and Circular Layouts

    A graph is an abstract network that represents a set of objects, called vertices, and relations between these objects, called edges. Graphs can model various networks. For example, a social network where the vertices correspond to users of the network and the edges represent relations between the …

    wurz-thes Repository record for Optimizing Crossings in Circular-Arc Drawings and Circular Layouts (opens in a new tab)

  11. Improved Neighbourhood Search-Based Methods for Graph Layout

    Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search-based methods for graph drawing that are based on optimising a fitness function which is formed from a weighted sum of multiple criteria. This thesis proposes a new neighbourhood search-based method …

    kent Download PDF for Improved Neighbourhood Search-Based Methods for Graph Layout (opens in a new tab)

  12. 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)

  13. 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 …

    ottawa-retro Repository record for Three-dimensional visualization of multi-layered graphs with application to communications (opens in a new tab)

  14. Simultaneous Embedding and Level Planarity

    Graphs are a common model for representing information consisting of a set of objects or entities and a set of connections or relations between them. Graph Drawing is concerned with the automatic visualization of graphs in order to make the information useful. That is, a good drawing should be …

    arizona-thes Repository record for Simultaneous Embedding and Level Planarity (opens in a new tab)

  15. 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)

  16. Supporting the design of custom static node-ling graph visualization

    Graph visualizations for communication appear in a variety of contexts that range from scientific/ academic to journalistic and even artistic. Unlike graph visualizations for exploration and analysis, these images are used to tell a story that is already known rather than to look for a story within …

    brazil-ufrgs Repository record for Supporting the design of custom static node-ling graph visualization (opens in a new tab)

  17. Parameterized complexity in graph theory, logic and machine learning

    … like treewidth are typically associated with graph algorithms, we expand their application to solve hard problems in three distinct domains: Graph Drawing, Explainable AI (XAI), and Logic. First, the thesis addresses the Two-Page Book Embedding problem within the classical domain of Graph …

    whiterose Download PDF for Parameterized complexity in graph theory, logic and machine learning (opens in a new tab)

  18. Constrained Graph Layouts: Vertices on the Outer Face and on the Integer Grid

    Constraining graph layouts - that is, restricting the placement of vertices and the routing of edges to obey certain constraints - is common practice in graph drawing. In this book, we discuss algorithmic results on two different restriction types: placing vertices on the outer face and on the …

    wurz-thes Repository record for Constrained Graph Layouts: Vertices on the Outer Face and on the Integer Grid (opens in a new tab)

  19. Visualizing biochemical networks with Netview

    Networks are modelled as graphs and are represented visually using graph-drawing algorithms. Visualization of such big networks help biologists understand them. In this paper, we present a Java 3d-based visualization toolkit called NetView that is designed for the interactive three-dimensional …

    missouri Repository record for Visualizing biochemical networks with Netview (opens in a new tab)

Page 1 of 5