P3P Made Easy
About
We revisit the classical Perspective-Three-Point (P3P) problem, which aims to recover the absolute pose of a calibrated camera from three 2D-3D correspondences. It has long been known that P3P can be reduced to a quartic polynomial with analytically simple and computationally efficient coefficients. However, this elegant formulation has been largely overlooked in modern literature. Building on the theoretical foundation that traces back to Grunert's work in 1841, we propose a compact algebraic solver that achieves accuracy and runtime comparable to state-of-the-art methods. Our results show that this classical formulation remains highly competitive when implemented with modern insights, offering an excellent balance between simplicity, efficiency, and accuracy.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| P3P solver | 10^8 simulated problems | Mean Time (ns)254.7 | 8 | |
| Perspective-Three-Point (P3P) pose estimation | 10^8 simulated problems | Mean Error1.51e-12 | 8 | |
| P3P problem solving | 10^8 simulated P3P problems | Valid Solutions Count1.69e+8 | 8 |