If I have $n$ known planes (known normal vector and a point on a plane) that intersect each other in such a way so as to form closely located 3D lines, then
(1). To get a common single 3D line to represent these intersections via least square solutions approach, minimally how many planes should be intersected?
(2). How do I get the best 3D line using least square minimization? Any formulae?
If i take profile view of planes, Red dots indicate the intersection lines (passing into the computer screen), so, i am looking for best line to be represented all of them.