Let $G$ be a graph obtained as the union of some $n$-vertex graph $H_n$ with minimum degree $δ(H_n)\geqαn$ and a $d$-dimensional random geometric graph $G^d(n,r)$. We investigate under which conditions for $r$ the graph $G$ will a.a.s. contain the $k$-th power of a Hamilton cycle, for any choice of $H_n$. We provide asymptotically optimal conditions for $r$ for all values of $α$, $d$ and $k$. This has applications in the containment of other spanning structures, such as $F$-factors.