Computing Upward Topological Book Embeddings of Upward Planar Digraphs

Journal of Discrete Algorithms(2023)

引用 17|浏览38
暂无评分
摘要
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.
更多
查看译文
关键词
Planar Graph,Computational Geometry,Upward Direction,Outerplanar Graph,External Face
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要