In this paper we study the treewidth of the random geometric graph, obtained by dropping n points onto the square [0, √n]² and connecting pairs of points by an edge if their distance is at most r = ...