Link discovery is central to the integration and use of data across RDF knowledge bases. Geospatial information is increasingly represented according to the Linked Data principles. Resources within such datasets are described by means of vector geometry, where link discovery approaches have to deal with millions of point sets consisting of billions of points. In this paper, we study the effect of simplifying the resources? geometries on runtime and F-measure of link discovery approaches. In particular, we evaluate link discovery approaches for computing the point-set distances as well as the topological relations among RDF resources with geospatial representation. The results obtained on two different real datasets suggest that most geospatial link discovery approaches achieve up to 67� speedup using simplification, while the average loss in their F-measure is less than 15\%. Our implementation is open-source and available at http://github.com/dice-group/limes.