Viewing Graph Solvability in Practice

F. Arrigoni, Tomás Pajdla, Andrea Fusiello
2/14/2026

Abstract

We present an advance in understanding the projective Structure-from-Motion, focusing in particular on the viewing graph: such a graph has cameras as nodes and fundamental matrices as edges. We propose a practical method for testing finite solvability, i.e., whether a viewing graph induces a finite number of camera configurations. Our formulation uses a significantly smaller number of equations (up to 400×) with respect to previous work. As a result, this is the only method in the literature that can be applied to large viewing graphs coming from real datasets, comprising up to 300K edges. In addition, we develop the first algorithm for identifying maximal finite-solvable components.

DOISemantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{arrigoni2026viewing,
  title  = {Viewing Graph Solvability in Practice},
  author = {F. Arrigoni and Tomás Pajdla and Andrea Fusiello},
  year   = {2026},
  doi    = {10.1109/ICCV51070.2023.00748},
  url    = {https://doi.org/10.1109/ICCV51070.2023.00748},
  journal = {ICCV 2023 2023}
}

Discussion