A lower bound for computing geometric spanners

It is known that the problem of computing (Steiner) spanners on a set of n   points has an Ω(nlog⁡n)Ω(nlog⁡n) lower bound. However, the proof is based on an example of points on the real line. Therefore, if we assume that the points belong to the plane or higher dimensions, and moreover, they are in general position, then the lower bound example does not work.In this paper, we show that the complexity of computing geometric spanners, possibly containing Steiner points, for a set of n points in d  -dimensional Euclidean space (RdRd) that are in general position is Ω(nlog⁡n)Ω(nlog⁡n), in the algebraic computation tree model. To this end, we reduce the spanner construction to a variant of the closest pair problem which has an Ω(nlog⁡n)Ω(nlog⁡n) lower bound.