Efficient algorithms and edge crossing properties of Euclidean minimum weight Laman graphs

We investigate the Euclidean minimum weight Laman graph on a planar point set P, for short. Bereg et al. (2016) studied geometric properties of and showed that the upper and lower bounds for the total number of edge crossings in are and , respectively. In this paper, we improve these upper and lower bounds to and for any , respectively. For improving the upper bound, we introduce a novel counting scheme based on some geometric observations. We also propose an time algorithm for computing , which was regarded as one of interesting future works by Bereg et al. (2016).