We present a simple and general algorithm for the all-pairs shortest paths (APSP) problem in unweighted geometric intersection graphs. Specically we reduce the problem to the design of static data structures for oine intersection detection. Consequently we can solve APSP in unweighted intersection graphs of n arbitrary disks in O n 2 log n time, axis-aligned line segments in O n 2 log log n time, arbitrary line segmentsWe also reduce the single-source shortest paths (SSSP) problem in unweighted geometric intersection graphs to decremental intersection detection. Thus, we obtain an O (n log n)-time SSSP algorithm in unweighted intersection graphs of n axis-aligned line segments.

No abstract

No abstract

No abstract

No abstract