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.
| Original language | English |
|---|---|
| Pages (from-to) | 15-24 |
| Number of pages | 10 |
| Journal | Computational Geometry: Theory and Applications |
| Volume | 51 |
| DOIs | |
| Publication status | Published - Jan 2016 |
| Externally published | Yes |
Keywords
- (k,l)-Sparse graphs
- Laman graphs
- Plane graphs
- Quasi-planarity
- k-Planarity
ASJC Scopus subject areas
- Computer Science Applications
- Geometry and Topology
- Control and Optimization
- Computational Theory and Mathematics
- Computational Mathematics