A near linear time approximation scheme for Steiner tree among obstacles in the plane

We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(nlog2n), where n denotes the number of terminals plus obstacle vertices. To this end, we show how a planar spanner of size O(nlogn) can be constructed that contains a (1+ϵ)-approximation of the optimal tree. Then one can find an approximately optimal Steiner tree in the spanner using the algorithm of Borradaile et al. (2007) for the Steiner tree problem in planar graphs. We prove this result for the Euclidean metric and also for all uniform orientation metrics, i.e. particularly the rectilinear and octilinear metrics.