## How to Embed a Path onto Two Sets of Points
Di Giacomo, Emilio and Liotta, Giuseppe and Trotta, Francesco
(2006)
Full text not available from this repository. ## AbstractLet R and B be two sets of points such that the points of R are colored red and the points of B are colored blue. Let P be a path such that |R| vertices of P are red and |B| vertices of P are blue. We study the problem of computing a crossing-free drawing of P such that each blue vertex is represented as a point of B and each red vertex of P is represented as a point of R. We show that such a drawing can always be realized by using at most one bend per edge.
Repository Staff Only: item control page References |