Critical Points for Two-view Triangulation

2016/08/19 by Hon-Leung Lee, Lee, Hon-Leung
Computer Science · Engineering · Mathematics · #Advanced Numerical Analysis Techniques #Advanced Optimization Algorithms Research #Algebraic Geometry (math.AG) #Computational Geometry and Mesh Generation #Computer Vision and Pattern Recognition (cs.CV) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)

paper · pdf · doi:10.48550/arxiv.1608.05512

openalex publication_date 2016/08/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Two-view triangulation is a problem of minimizing a quadratic polynomial under an equality constraint. We derive a polynomial that encodes the local minimizers of this problem using the theory of Lagrange multipliers. This offers a simpler derivation of the critical points that are given in Hartley-Sturm [6].

Related

• Calculus, constrained minimization and Lagrange multipliers: Is the optimal critical point a local minimizer?
• Counting Number of Triangulations of Point Sets: Reinterpreting and Generalizing the Triangulation Polynomials
• A QCQP Approach to Triangulation
• Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
• Newton-Type Iterative Solver for Multiple View L2 Triangulation