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 of approaches examines aesthetics of nodes, edges, or graph layout, and related readability metrics. In this thesis, two solutions incorporating Gestalt principles to alleviate the effects of the edge crossing problem are presented. Alleviating this problem improves graph aesthetics and readability. Secondly, improving the known bounds on two aesthetic requirements (area and aspect ratio) for planar straight-line order-preserving grid drawings of binary trees is presented in a novel algorithm using a separations approach. The new bounds are optimal in area and aspect ratio, where the optimum values are linear and 1:1 respectively. All three topics present novel contributions to graph and tree drawing ultimately leading to a potential for improved readability and aesthetics requirements.

Name thesis:degree_name

M.S. Computer Science

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer Science

Year dc:date.available

2012

Author dc:creator

• Fabian, Andrew

Contributors dc:contributor

• Rusu, Adrian

• Graph theory; Information visualization
• Computer Sciences

Repository record dc:identifier

https://rdw.rowan.edu/etd/485

OAI identifier oai:identifier

oai:rdw.rowan.edu:etd-1484