David Bremner;Olivier Devillers;Marc Glisse;Sylvain Lazard;Giuseppe Liotta;Tamara Mchedlidze;Guillaume Moroz;Sue Whitesides;Stephen Wismath
1 Faculty of Computer Science
2 Geometric Algorithms and Models Beyond the Linear and Euclidean realm
3 Understanding the Shape of Data
4 Dipartimento di Matematica e Informatica [Perugia]
5 Institute of Theoretical Informatics
6 Department of Computer Science [Victoria]
7 Department of Mathematics and Computer Science
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.