Computing Upward Topological Book Embeddings of Upward Planar Digraphs
This paper studies the problem of computing an upward topological book embedding of an upward planar digraph G, i.e. a topological book embedding of G where all edges are monotonically increasing in the upward direction. Besides having its own inherent interest in the theory of upward book embeddability, the question has applications to well studied research topics of computational geometry and of graph drawing. The main results of the paper are as follows.
Every upward planar digraph G with n vertices admits an upward topological book embedding such that every edge of G crosses the spine of the book at most once.
Every upward planar digraph G with n vertices admits a point-set embedding on any set of n distinct points in the plane such that the drawing is upward and every edge of G has at most two bends.
Every pair of upward planar digraphs sharing the same set of n vertices admits an upward simultaneous embedding with at most two bends per edge.
Unable to display preview. Download preview PDF.
- 1.Alzohairi, M., Rival, I.: Series-parallel ordered sets have pagenumber two. In: North, S. (ed.) GD 1996. LNCS, vol. 1190, pp. 11–24. Springer, Heidelberg (1997)Google Scholar
- 15.Giordano, F., Liotta, G., Mchedlidze, T., Symvonis, T.: Computing upward topological book embeddings of upward planar digraphs. Technical report, RT-007-02 (2007)Google Scholar
- 25.Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. Lecture Notes Series on Computing, vol. 12. World Scientific (2004)Google Scholar
- 27.Sugiyama, K.: Graph Drawing and Application for Software amd Knowledge Engineers. World Scientific, Singapore (2001)Google Scholar