Spanners for Geometric Intersection Graphs

Download PDF
Open Webpage

Martin Fürer, Shiva Prasad Kasiviswanathan

Published: 2007, Last Modified: 09 Nov 2025WADS 2007EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: A disk graph is an intersection graph of a set of disks with arbitrary radii in the plane. In this paper, we consider the problem of efficient construction of sparse spanners of disk (ball) graphs with support for fast distance queries. These problems are motivated by issues arising from topology control and routing in wireless networks.