An iterative algorithm for reconstructing inscribed triangles (Q749186)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4172341
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative algorithm for reconstructing inscribed triangles |
scientific article; zbMATH DE number 4172341 |
Statements
An iterative algorithm for reconstructing inscribed triangles (English)
0 references
1989
0 references
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.
0 references
integral geometry
0 references
Radon transform
0 references
reconstruction of inscribed triangles
0 references
algorithm
0 references
0 references
0.8466331958770752
0 references
0.7863684892654419
0 references
0.7718153595924377
0 references
0.7654079794883728
0 references
0.7472304701805115
0 references
