Embedding Four-Directional Paths on Convex Point Sets
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.
Unable to display preview. Download preview PDF.
- 1.Aichholzer, O., Hackl, T., Lutteropp, S., Mchedlidze, T., Vogtenhuber, B.: Embedding four-directional paths on convex point sets. arXiv e-prints arXiv:1408.4933 [cs.CG] (2014)Google Scholar
- 2.Aichholzer, O., Krasser, H.: The point set order type data base: A collection of applications and results. In: 13th Annual Canadian Conference on Computational Geometry (CCCG 2001), pp. 17–20 (2001)Google Scholar
- 7.Bannister, M.J., Devanny, W.E., Eppstein, D.: Small superpatterns for dominance drawing. CoRR abs/1310.3770 (2013)Google Scholar
- 8.Biedl, T., Vatshelle, M.: The point-set embeddability problem for plane graphs. In: 28th Annual Symposium on Computational Geometry (SoCG 2012), pp. 41–50. ACM (2012)Google Scholar
- 20.Zhang, C.Q.: Some results on tournaments. J. Qufu Teachers College (1), 51–53 (1985)Google Scholar