Abstract: The concept of viewing graph solvability has gained
significant interest in the context of structure-from-motion. A
viewing graph is a mathematical structure where nodes are
associated with cameras and edges represent the epipolar geometry connecting overlapping views. Solvability studies under
which conditions the cameras are uniquely determined by the
graph. In this paper we propose a novel framework for analyzing
solvability problems based on algebraic geometry, demonstrating
its potential in understanding structure-from-motion graphs and
proving a conjecture that was previously proposed
Loading