Monotone Simultaneous Embeddings of Paths in Rd
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 ≥ 2, there is a set of d+1 paths that does not admit a monotone simultaneous geometric embedding.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.