Rectangle of Influence Drawings of Graphs without Filled 3-Cycles
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.
- 3.J. Bondy and U. Murty. Graph Theory and Applications. Amerian Elsevier Publishing Co., 1976.Google Scholar
- 5.G. Di Battista, W. Lenhart, and G. Liotta. Proximinity drawability: A survey. In R. Tamassia and I. Tollis, editors, DIMACS International Workshop, Graph Drawing 94, volume 894 of Lecture Notes in Computer Science, pages 328–339. Springer-Verlag, 1995.Google Scholar
- 10.F. Preparata and M. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.Google Scholar