An iterative algorithm for reconstructing inscribed triangles
Let K be a convex smooth body in \({\mathbb{R}}^ 2\), and let three directions be given. According to a theorem of \textit{H. Kramer} and \textit{A. B. Németh} [Rev. Anal. Numér. Théorie Approximation 1, 63-71 (1972; Zbl 0352.53002)] there are precisely two triangles inscribed to K with sides parallel to the given directions. The paper gives an algorithm for determining these triangles from the projection of K in the given directions. The algorithm is applied to the problem of recovering K from four projections.
scientific article; zbMATH DE number 4172341