Companion Surface of Danger Cylinder and its Role in Solution Variation of P3P Problem
Bo wang, Hao Hu, Caixia Zhang

TL;DR
This paper introduces the Companion Surface of Danger Cylinder (CSDC), a new geometric surface that explains how the number of solutions in the P3P problem changes as the optical center moves, enhancing understanding of multi-solution phenomena.
Contribution
It reveals the existence of the CSDC, a polynomial surface of degree 12, which acts as a boundary where the number of P3P solutions changes, providing new insights into solution stability and multiplicity.
Findings
CSDC is a polynomial surface of degree 12 related to the danger cylinder.
Passing through CSDC changes the number of P3P solutions by 2.
CSDC acts as a delimitating surface of the P3P solution space.
Abstract
Traditionally the danger cylinder is intimately related to the solution stability in P3P problem. In this work, we show that the danger cylinder is also closely related to the multiple-solution phenomenon. More specifically, we show when the optical center lies on the danger cylinder, of the 3 possible P3P solutions, i.e., one double solution, and two other solutions, the optical center of the double solution still lies on the danger cylinder, but the optical centers of the other two solutions no longer lie on the danger cylinder. And when the optical center moves on the danger cylinder, accordingly the optical centers of the two other solutions of the corresponding P3P problem form a new surface, characterized by a polynomial equation of degree 12 in the optical center coordinates, called the Companion Surface of Danger Cylinder (CSDC). That means the danger cylinder always has a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Optimization and Search Problems
