Layouts with wires of balanced length
For any graph (with fixed boundary) there exists a layout, which minimizes the maximum distance of any node to its neighbours. This layout balances the length of the wires (corresponding to graph edges) and is called (length-) balanced layout.
L is the minimal element of an order defined on the set of layouts of a graph with fixed boundary.
L may be constructed as the limit of the 1p-optimal layouts Lp of G.
If G is a planar graph with fixed boundary, then the optimal balanced layout L of G is ‘quasi-planar’.
KeywordsPlanar Graph Minimal Element Optimal Layout Graph Edge Planar Layout
Unable to display preview. Download preview PDF.
- [BeHo]B.Becker, G.Hotz: ‘On the Optimal Layout of Planar Graphs with Fixed Boundary', T.R., 03/1983, SFB 124, SaarbrückenGoogle Scholar
- [Os]H.G. Osthof: ‘Der minimale Kreis um eine endliche Punktmenge', Diplomarbeit, Saarbrücken 1983Google Scholar
- [ShHo]M.I.Shamos, D.Hoey: ‘Closest-Point Problems', Proc. 16th IEEE Symp. on Foundations of Comput. Sci., Oct. 1975, pp. 151–162Google Scholar