Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Kano, M., Suzuki, K.: Discrete geometry on red and blue points in the plane lattice (preprint)
Battista, G.D., Eardes, P., Tamassia, R., Tollis, I.G.: Graph drawing. Printice-Hall (1999)
Katz, B., Krug, M., Rutter, I., Wolff, A.: Manhattan-Geodesic Embedding of Planar Graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 207–218. Springer, Heidelberg (2010)
Nishizeki, T., Rahman, M.S.: Planar graph drawing. World Scientific (2004)
Pach, J. (ed.): Towards a theory of geometric graphs. Contemporary Mathematics, vol. 342. AMS (2004)
Raghavan, R., Cohoon, J., Sahni, S.: Single bend wiring. J. of Algorithms 7, 232–257 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kano, M., Suzuki, K. (2012). Geometric Graphs in the Plane Lattice. In: Márquez, A., Ramos, P., Urrutia, J. (eds) Computational Geometry. EGC 2011. Lecture Notes in Computer Science, vol 7579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34191-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-34191-5_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34190-8
Online ISBN: 978-3-642-34191-5
eBook Packages: Computer ScienceComputer Science (R0)