Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d

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...

Full description

Bibliographic Details

Published in:	Discrete mathematics and theoretical computer science Vol. 20 no. 1; no. Discrete Algorithms; pp. 1 - 11
Main Authors:	Bremner, David, Devillers, Olivier, Glisse, Marc, Lazard, Sylvain, Liotta, Giuseppe, Mchedlidze, Tamara, Moroz, Guillaume, Whitesides, Sue, Wismath, Stephen
Format:	Journal Article
Language:	English
Published:	DMTCS 05.01.2018 Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-cg] computer science [cs]/computational geometry [cs.cg] algorithm Computational Geometry Computer Science graph drawing high-dimensional space point hyperplane duality graph drawing point hyperplane duality algorithm high-dimensional space
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!