Packing plane spanning graphs with short edges in complete geometric graphs

O. Aichholzer, T. Hackl, M. Korman, A. Pilz, A. van Renssen, M. Roeloffzen, G. Rote, and B. Vogtenhuber

Abstract:

Given a set of points in the plane, we want to establish a connected spanning graph between these points, called connection network, that consists of several disjoint layers. Motivated by sensor networks, our goal is that each layer is connected, spanning, and plane. No edge in this connection network is too long in comparison to the length needed to obtain a spanning tree. We consider two different approaches. First we show an almost optimal centralized approach to extract two layers. Then we consider a distributed model in which each point can compute its adjacencies using only information about vertices at most a predefined distance away. We show a constant factor approximation with respect to the length of the longest edge in the graphs. In both cases the obtained layers are plane.

Reference: O. Aichholzer, T. Hackl, M. Korman, A. Pilz, A. van Renssen, M. Roeloffzen, G. Rote, and B. Vogtenhuber. Packing plane spanning graphs with short edges in complete geometric graphs. Computational Geometry, 782:1-15, 2019.