Geometric Graphs in the Plane Lattice
An L-line segment in the plane consists of a vertical line segment and a horizontal line segment having a common end-point. In this paper, we consider some problems on non-crossing geometric embeddings of graphs in the plane lattice, whose vertices are given points of the plane lattice in general position and whose edges are suitable L-line segments.
KeywordsLine Segment Horizontal Line General Position Plane Lattice Hamilton Path
Unable to display preview. Download preview PDF.
- 1.Kaneko, A., Kano, M.: Discrete geometry on red and blue points in the plane — A survey. In: Discrete and Computational Geometry. Algorithms and Combinatorics, vol. 25, pp. 551–570. Springer (2003)Google Scholar
- 2.Kano, M., Suzuki, K.: Discrete geometry on red and blue points in the plane lattice (preprint)Google Scholar
- 3.Battista, G.D., Eardes, P., Tamassia, R., Tollis, I.G.: Graph drawing. Printice-Hall (1999)Google Scholar
- 5.Nishizeki, T., Rahman, M.S.: Planar graph drawing. World Scientific (2004)Google Scholar
- 6.Pach, J. (ed.): Towards a theory of geometric graphs. Contemporary Mathematics, vol. 342. AMS (2004)Google Scholar