Monotone Simultaneous Paths Embeddings in R-d

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE(2018)

引用 0|浏览2
暂无评分
摘要
We study the following problem: Given k paths that share the same labeled vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is monotone in some direction? We prove that for any dimension d >= 2, there is a set of d + 1 paths that does not admit a monotone simultaneous geometric embedding.
更多
查看译文
关键词
graph drawing,point hyperplane duality,high-dimensional space,algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要