Monotone Simultaneous Embeddings of Paths in R^d
classification
💻 cs.CG
cs.DS
keywords
pathsmonotonesimultaneousembeddinggeometricthereadmitdimension
read the original abstract
We study the following problem: Given $k$ paths that share the same 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 \geq 2$, there is a set of $d+1$ paths that does not admit a monotone simultaneous geometric embedding.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.