Andrew Pavlo

Abstract

We introduce an interactive graph visualization scheme that allows users to explore graphs by viewing them as a sequence of spanning trees, rather than the entire graph all at once. The user determines which spanning trees are displayed by selecting a vertex from the graph to be the root. Our main contributions are a graph drawing algorithm that generates meaningful representations of graphs using extracted spanning trees, and a graph animation algorithm for creating smooth, continuous transitions between graph drawings. We conduct experiments to measure how well our algorithms visualize graphs and compare them to another visualization scheme.

Library of Congress Subject Headings

Computer graphics; Graph theory--data processing

Publication Date

2006

Document Type

Thesis

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Homan, Christopher

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: T385 .P39 2006

Campus

RIT – Main Campus

Download

Share

COinS