Browsing Theses by Subject "graph drawing"
Now showing items 1-6 of 6
-
Area-Efficient Drawings of Outer-1-Planar Graphs
(University of Waterloo, 2020-09-29)We study area-efficient drawings of planar graphs: embeddings of graphs on an integer grid so that the bounding box of the drawing is minimized. Our focus is on the class of outer-1-planar graphs: the family of planar ... -
Drawing planar graphs with prescribed face areas
(University of Waterloo, 2010-09-08)This thesis deals with planar drawings of planar graphs such that each interior face has a prescribed area. Our work is divided into two main sections. The rst one deals with straight-line drawings and the second one ... -
Graph Morphing via Orthogonal Box Drawings
(University of Waterloo, 2023-12-18)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 ... -
On Geometric Drawings of Graphs
(University of Waterloo, 2018-04-18)This thesis is about geometric drawings of graphs and their topological generalizations. First, we study pseudolinear drawings of graphs in the plane. A pseudolinear drawing is one in which every edge can be extended ... -
A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs
(University of Waterloo, 2003)We can visualize a graph by producing a geometric representation of the graph in which each node is represented by a single point on the plane, and each edge is represented by a curve that connects its two ... -
Upward Octagonal Drawings of Ternary Trees
(University of Waterloo, 2016-09-08)We explore ways to embed a ternary tree in an integer coordinate grid such that the width of the drawing is minimized. We provide upper and lower bounds on the width requirement of planar, straight-line, upward, order-preserving ...