mlsanityData to 7 Oct 2026

Absolute Triangulation Algorithms for Space Exploration

arXiv 2205.12197 ↗First posted 24 May 2022cs.CVcited by 5

Not on the map. Why?

Abstract (arXiv)

Images are an important source of information for spacecraft navigation and for three-dimensional reconstruction of observed space objects. Both of these applications take the form of a triangulation problem when the camera has a known attitude and the measurements extracted from the image are line of sight (LOS) directions. This work provides a comprehensive review of the history and theoretical foundations of triangulation. A variety of classical triangulation algorithms are reviewed, including a number of suboptimal linear methods (many LOS measurements) and the optimal method of Hartley and Sturm (only two LOS measurements). It is shown that the optimal many-measurement case may be solved without iteration as a linear system using the new Linear Optimal Sine Triangulation (LOST) method. Both LOST and the polynomial method of Hartley and Sturm provide the same result in the case of only two measurements. The various triangulation algorithms are assessed with a few numerical examples, including planetary terrain relative navigation, angles-only optical navigation at Uranus, 3-D reconstruction of Notre-Dame de Paris, and angles-only relative navigation.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 1 of its 119 references that are in the map. First posted on arXiv 24 May 2022.

Builds on

1 of 119 references.

References · 1

  1. 2020TEASER: Fast and Certifiable Point Cloud Registrationcited by 274

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 2; 2025: 0; 2026: 1.

5 papers.