Sampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time