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. © 2012 Springer-Verlag.
CITATION STYLE
Kano, M., & Suzuki, K. (2012). Geometric graphs in the plane lattice. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7579 LNCS, pp. 274–281). https://doi.org/10.1007/978-3-642-34191-5_26
Mendeley helps you to discover research relevant for your work.