How to Embed a Path onto Two Sets of Points

Di Giacomo, Emilio and Liotta, Giuseppe and Trotta, Francesco (2006) How to Embed a Path onto Two Sets of Points. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 111-116(Official URL: http://dx.doi.org/10.1007/11618058_11).

Full text not available from this repository.

Abstract

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

Item Type: Conference Paper
Additional Information: 10.1007/11618058_11
Classifications: M Methods > M.600 Planar
G Algorithms and Complexity > G.490 Embeddings
P Styles > P.540 Planar
G Algorithms and Complexity > G.560 Geometry
G Algorithms and Complexity > G.210 Bends
URI: http://gdea.informatik.uni-koeln.de/id/eprint/685

Actions (login required)

View Item View Item