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.
Cite
CITATION STYLE
Biedl, T., Bretscher, A., & Meijer, H. (1999). Rectangle of influence drawings of graphs without filled 3-cycles? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1731, pp. 359–368). Springer Verlag. https://doi.org/10.1007/3-540-46648-7_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
