An iterative algorithm for reconstructing inscribed triangles
From MaRDI portal
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.
Recommendations
- An algorithm for reconstructing convex bodies from their projections
- Tomographic reconstruction of a convex body
- Reconstruction of convex bodies from brightness functions
- Questions of stability in some inverse problems of the reconstruction of convex compacta by their projections
- A Three-Point Solution to Hammer's X-Ray Problem
Cites work
- Characterisation of measurable plane sets which are reconstructable from their two projections
- scientific article; zbMATH DE number 4001918 (Why is no real title available?)
- On successive approximations for nonexpansive mappings in Banach spaces
- Tomographic reconstruction of a convex body
- Tomography of convex bodies and inscribed polygons
Cited in
(3)
This page was built for publication: An iterative algorithm for reconstructing inscribed triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749186)
