The fact that distance geometry (DG) is universal enough to encode SAT problems is well known. In this talk I will argue that DG is universal from a more informal, but less computational point of view: the range of the applications for which DG is used is considerable. I will speak about nanostructures, finding vector representations for words and sentences, and ensuring that moving agents always keep a minimum distance between them.