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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
N. Alon, Z. Füredi, and M. Katchalski. Separating pairs of points by standard boxes. European Journal of Combinatorics, 6:205–210, 1985.
T. Biedl, G. Kant, and M. Kaufmann. On triangulating planar graphs under the four-connectivity constraint. Algorithmica, 19(4):427–446, 1997.
J. Bondy and U. Murty. Graph Theory and Applications. Amerian Elsevier Publishing Co., 1976.
M. de Berlin, S. Carlsson, and M. Overmars. A general approach to dominance in the plane. Journal of Algorithms, 13:274–296, 1992.
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.
H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41–51, 1990.
M. Ichino and J. Sklansky. The relative neighborhood graph for mixed feature variables. Pattern Recognition, 18(2):161–167, 1985.
G. Liotta, A. Lubiw, H. Meijer, and S. Whitesides. The Rectangle of Influence drawability problem. Computational Geometry: Theory and Applications, 10(1):1–22, 1998.
M.H. Overmars and D. Wood. On rectangular visibility. Journal of Algorithms, 9(3):372–390, 1988.
F. Preparata and M. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biedl, T., Bretscher, A., Meijer, H. (1999). Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. In: Kratochvíyl, J. (eds) Graph Drawing. GD 1999. Lecture Notes in Computer Science, vol 1731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46648-7_37
Download citation
DOI: https://doi.org/10.1007/3-540-46648-7_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66904-3
Online ISBN: 978-3-540-46648-2
eBook Packages: Springer Book Archive