Conference
Monotone Simultaneous Embeddings of Paths in d Dimensions
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, there is a set of $$d+1$$ paths that does not admit a monotone simultaneous geometric embedding.
Authors
Bremner D; Devillers O; Glisse M; Lazard S; Liotta G; Mchedlidze T; Whitesides S; Wismath S
Series
Lecture Notes in Computer Science
Volume
9801
Pagination
pp. 546-553
Publisher
Springer Nature
Publication Date
2016
DOI
10.1007/978-3-319-50106-2_42
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743