Embedding Four-Directional Paths on Convex Point Sets

Aichholzer, Oswin and Hackl, Thomas and Lutteropp, Sarah and Mchedlidze, Tamara and Vogtenhuber, Birgit (2014) Embedding Four-Directional Paths on Convex Point Sets. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 355-366(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_30).

Full text not available from this repository.


A directed path whose edges are assigned labels “up”, “down”, “right”, or “left” is called four-directional, and three-directional if at most three out of the four labels are used. A direction-consistent embedding of an n-vertex four-directional path P on a set S of n points in the plane is a straight-line drawing of P where each vertex of P is mapped to a distinct point of S and every edge points to the direction specified by its label. We study planar direction-consistent embeddings of three- and four-directional paths and provide a complete picture of the problem for convex point sets.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-662-45803-7_30
Classifications: G Algorithms and Complexity > G.490 Embeddings
G Algorithms and Complexity > G.560 Geometry
G Algorithms and Complexity > G.630 Labeling
P Styles > P.720 Straight-line
Z Theory > Z.750 Topology
Depositing User: Administration GDEA
Date Deposited: 22 May 2015 11:35
Last Modified: 22 May 2015 11:35
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1446

Actions (login required)

View Item View Item