Abstract
This paper is concerned with the crossing number of Euclidean minimum-weight Laman graphs in the plane. We first investigate the relation between the Euclidean minimum-weight Laman graph and proximity graphs, and then we show that the Euclidean minimum-weight Laman graph is quasi-planar and 6-planar. Thus the crossing number of the Euclidean minimum-weight Laman graph is linear in the number of points. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Bereg, S., Hong, S. H., Katoh, N., Poon, S. H., & Tanigawa, S. I. (2013). On the edge crossing properties of Euclidean minimum weight Laman graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8283 LNCS, pp. 33–43). https://doi.org/10.1007/978-3-642-45030-3_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
