In a recent work, Huang and Tikhomirov considered the shotgun assembly for Erd\H os-Rényi graphs $\mathcal G(n,p_n)$ with $p_n=n^{-α}$, and showed that the graph is reconstructable if $0<α< \frac{1}{2}$ and not reconstructable if $\frac{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\H os-Rényi random graphs, we show that the random geometric graph is always reconstructable from its 1-neighbourhoods.