Constructing Rectangle Visibility Layouts for Rectangle Visibility Graphs

Publication Year:
2011
Usage 17
Abstract Views 17
Repository URL:
https://scholarworks.gvsu.edu/ssd/2011/Presentations/40
Author(s):
Todd Peterson
article description
In graph theory, a graph is a set of nodes and the connections between those nodes. We will look at graphs called Rectangle Visibility Graphs (RVGs), which are graphs that can be represented as a set of rectangles in the plane with connections represented by visibilities between rectangles. RVGs have an important application in VLSI chip design, where rectangle layouts can model the layout of a chip where components have a necessary set of connections. We will look at whether or not all graphs are RVGs, and then explore some of the ways rectangle visibility layouts can be constructed for a given graph where possible. A new algorithm for constructing rectangle layouts for certain graphs will be presented.