In a recent work, Huang and Tikhomirov considered the shotgun assembly for Erdős-Rényi graphs G(n, pn) with pn = n −α , and showed that the graph is reconstructable if 0 < α < 1 2 and not reconstructable if 1 2 < α < 1 from its 1-neighbourhoods. In this article, we consider random geometric graphs G(n, r), where r 2 = n −α and 0 < α < 1, on flat torus. Interestingly, unlike the results for the Erdős-Rényi random graphs, we show that the random geometric graph is always reconstructable from its 1-neighbourhoods.