Reconstructing convex polygons in the plane from one directed X-ray (Q5939543): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 01:47, 30 January 2024

scientific article; zbMATH DE number 1626141
Language Label Description Also known as
English
Reconstructing convex polygons in the plane from one directed X-ray
scientific article; zbMATH DE number 1626141

    Statements

    Reconstructing convex polygons in the plane from one directed X-ray (English)
    0 references
    19 May 2002
    0 references
    A convex polygon in the plane can be uniquely determined by two directed X-rays, and with the exception of a simple class of polygons (parallel wedges), one directed X-ray will suffice [see e.g. \textit{R. J. Gardner}, Discrete Comput. Geom. 7, No. 3, 281-293 (1992; Zbl 0748.52003)]. A directed X-ray consists of integrals over all rays emanating from a fixed source. The authors prove that well known uniqueness theorem by elementary methods that lend themselves to computation and reconstruction. They give, probably for the first time, algorithms for reconstructing convex polygons from one directed X-ray.
    0 references
    0 references
    0 references
    Hammer's X-ray problem
    0 references
    reconstruction of convex polygons
    0 references