Generalisation of the “mid-point” method for triangulation to n points
computer-vision, triangulation
Solution
Yes there is a generalisation to N points. I have saw it in some articles:
P. A. Beardsley, A. Zisserman, and D. W. Murray. Sequential updating of projective and affine structure from motion. Int. J. Comput. Vision, 23(3) :235–259, June 1997
Srikumar Ramalingam, Suresh K. Lodha, and Peter Sturm. A generic structure- from-motion framework. Comput. Vis. Image Underst., 103(3) :218–228, September 2006.
You can also read the book (the refererence of your wikipedia article)
Richard Hartley and Andrew Zisserman (2003). Multiple View Geometry in computer vision. Cambridge University Press. ISBN 978-0-521-54051-3.
But it do not mention the midpoint for N views as I remember, only for two views while this method is depicted as innacurate (Not strictly my thinking).
I hope it will be helpful.
Problem
In Computer Vision the "mid-point" method solves the triangulation problem of determining a 3D point from two 2D points (see here). Is there a generalisation of this to more than two points, say n points, and what is it called? The article does mention Direct Linear Transformation, but I'm not sure this is what I'm looking for...