Convex Drawings of Graphs with Non-convex Boundary
In this paper, we study a new problem of finding a convex drawing of graphs with a non-convex boundary. It is proved that every triconnected plane graph whose boundary is fixed with a star-shaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. Such a drawing, called an inner-convex drawing, can be obtained in linear time.
Unable to display preview. Download preview PDF.
- 1.Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1998)Google Scholar
- 2.Chiba, N., Yamanouchi, T., Nishizeki, T.: Linear algorithms for convex drawings of planar graphs. In: Progress in Graph Theory, pp. 153–173. Academic Press, London (1984)Google Scholar
- 3.Fáry, I.: On straight line representations of planar graphs. Acta Sci. Math. Szeged 11, 229–233 (1948)Google Scholar
- 4.Hong, S.-H., Nagamochi, H.: Convex drawings of hierarchical plane graphs. In: Proc. of AWOCA 2006 (to appear, 2006)Google Scholar
- 5.Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. North-Holland Mathematics Studies 140/32 (1988)Google Scholar
- 6.Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1993)Google Scholar
- 7.Thomassen, C.: Plane representations of graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Progress in Graph Theory, pp. 43–69. Academic Press, London (1984)Google Scholar