# An Algebraic Geometry Approach to Viewing Graph Solvability

arXiv: https://arxiv.org/abs/2504.03637 · HTML: https://mlsanity.com/paper/2504.03637/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 7 of its 35 references that are in the map.
- First posted on arXiv 4 Apr 2025.

## Builds on (most cited first, 7 of 7)

- [Pixel-Perfect Structure-from-Motion with Featuremetric Refinement](https://mlsanity.com/paper/2108.08291/) (2021)
- [A Survey of Structure from Motion](https://mlsanity.com/paper/1701.08493/) (2017)
- [PLMP -- Point-Line Minimal Problems in Complete Multi-View Visibility](https://mlsanity.com/paper/1903.10008/) (2019)
- [GPSfM: Global Projective SFM Using Algebraic Constraints on Multi-View Fundamental Matrices](https://mlsanity.com/paper/1812.00426/) (2018)
- [A New Rank Constraint on Multi-view Fundamental Matrices, and its Application to Camera Location Recovery](https://mlsanity.com/paper/1702.03023/) (2017)
- [Snapshot of Algebraic Vision](https://mlsanity.com/paper/2210.11443/) (2022)
- [On the Solvability of Viewing Graphs](https://mlsanity.com/paper/1808.02856/) (2018)

## Abstract (arXiv)

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 to 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.