Embedding FourDirectional Paths on Convex Point SetsAichholzer, Oswin and Hackl, Thomas and Lutteropp, Sarah and Mchedlidze, Tamara and Vogtenhuber, Birgit (2014) Embedding FourDirectional Paths on Convex Point Sets. In: Graph Drawing 22nd International Symposium, GD 2014, September 2426, 2014 , pp. 355366(Official URL: http://dx.doi.org/10.1007/9783662458037_30). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/9783662458037_30
AbstractA directed path whose edges are assigned labels “up”, “down”, “right”, or “left” is called fourdirectional, and threedirectional if at most three out of the four labels are used. A directionconsistent embedding of an nvertex fourdirectional path P on a set S of n points in the plane is a straightline 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 directionconsistent embeddings of three and fourdirectional paths and provide a complete picture of the problem for convex point sets.
Actions (login required)
