For a given finite set P of points in the plane, we want to construct a plane straight-line graph G that contains P as vertices such that detours in G (the ratio of G-distances between vertices and their Euklidian distance) are minimized. We show that with a few regular exceptions, for essentially no point set P the worst-case detour can be made arbitrarily small (close to 1). In other words, almost all point sets possess an intrinsic "rigidity" that makes it impossible to embed them in a geometric network with arbitrarily small (multiplicatively measured) detours.