Weighted visibility graphs of bars and related flow problems
- 673 Downloads
A layout is a set of vertically oriented non-intersecting line segments in the plane called bars. The visibility graph associated with a layout is defined as a graph whose vertices correspond to the bars, and whose weighted edges represent the visibility between bars. (Two bars ū and \(\bar v\) are visible for t units, if a rectangle of vertical thickness t can be drawn with opposite sides on ū and \(\bar v\), and without intersecting any other bar.) This paper provides a polynomial time solution to the problem of determining, for a given edge-weighted graph, whether there exists a corresponding layout of bars, and if so constructing such a layout. The problem is first re-expressed as a constrained network flow problem. It is in this domain that an algorithm is developed. Futhermore, the flow formulation permits us to illustrate the proximity of this layout problem to related NP-hard flow problems.
KeywordsPlanar Graph Layout Problem Visibility Graph Vertical Thickness Brute Force Approach
Unable to display preview. Download preview PDF.
- M. Garey, D. Johnson, H. So, An Application of Graph Coloring to Printed Circuit Testing, 1975 FOCS.Google Scholar
- S. Ghosh, On Recognizing and characterizing visibility graphs of simple polygons, The Johns Hopkins University/EECS Technical Report 86/14, 1986.Google Scholar
- J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press (1987).Google Scholar
- P. Rosenstiehl, R. Tarjan, Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs, Discrete and Computational Geometry, 1 (1986), 343–353.Google Scholar
- R. Tamassia, I. Tollis, A Unified Approach to Visibility Representations of Planar Graphs, Discrete and Computational Geometry, 1 (1986), 321–341.Google Scholar
- S. K. Wismath, Characterizing Bar Line-of-Sight Graphs, Proc. 1st ACM Symposium on Computational Geometry, Baltimore (1985), 147–152.Google Scholar