We study optimal geographic content placement for device-to-device (D2D) networks in which each file’s popularity follows the Zipf distribution. The locations of the D2D users (caches) are modeled by a Poisson point process (PPP) and have limited communication range and finite storage. We propose several novel spatially correlated caching strategies, and contrast them with the baseline independent content placement which is used in most prior work. We name these strategies as the “Gibbs” point process-based soft-core caching that captures the pairwise interactions between users, including attraction or repulsion. We derive and optimize the hit probability, which is the probability that a given D2D node can find a desired file at another node within its communication range. The Gibbs placement model shows that repulsive cache placement often yields a higher cache hit probability. We further consider the Mat'{e}rn hard-core (MHC) model, which is a special case of Gibbs repulsive cache placement, and show that MHC placement is effective for small cache sizes and a small communication radius, which are likely conditions for D2D.