Lecture Notes in Computer Science, 1999, Volume 1731/1999, 359-368, DOI: 10.1007/3-540-46648-7_37

Rectangle of Influence Drawings of Graphs without Filled 3-Cycles

Therese Biedl, Anna Bretscher and Henk Meijer

View Related Documents

Abstract

In this paper, we study rectangle of influence drawings, i.e., drawings of graphs such that for any edge the axis-parallel rectangle defined by the two endpoints of the edge is empty. Specifically, we show that if G is a planar graph without filled 3-cycles, i.e., a planar graph that can be drawn such that the interior of every 3-cycle is empty, then G has a rectangle of influence drawing.
The results are part of the second author’s Master’s thesis at Queen’s University.
Research partially supported by NSERC. Part of this research was done while the author was at McGill University.

Fulltext Preview

Image of the first page of the fulltext document