The circle packing theorem (Koebe–Andreev–Thurston theorem) states that every finite planar graph is the nerve of some disk packing in the plane, where the nerve of a packing $P$ is a graph $G=(V,E)$, where there is an edge $(u,w) \in E(G)$ when $\partial P\_{u} \cap \partial P\_{w} \neq \varnothing$, for disks $P\_{u},P\_{w} \in P$.


More succintly, for every connected simple planar graph $G$ there is a circle packing in the plane whose intersection graph is (isomorphic to) $G$.


I am interested in the possibility of extending this result to dimension three, where we would be considering a homogeneous connected simplicial $3$-complex as the nerve of a sphere packing $P$.


Has there been any research done to suggest that such a theorem exists in three dimensions, or a counterexample that this is not the case?



Generalizing the circle packing theorem to 3-dimensions
@Lee's comment is correct, and the answer to the question he cites give an almost complete picture, but you might also want to look at the following: 


Combinatorial scalar curvature and rigidity of ball packings
D. Cooper and I. Rivin
Math Res Letters, 1996


(note: all the results in the papers are correct, but one of the proofs is wrong, and fixed by Dave Glickenstein a few years later).


