Finding needles in a haystack (Q2225658): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Árpád Kurusa / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Pedro Martín Jiménez / rank
Normal rank
 
Property / author
 
Property / author: Árpád Kurusa / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Pedro Martín Jiménez / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-020-00217-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3038921306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical potential theory and its probabilistic counterpart. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets subtending a constant angle on a circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The determination of a convex set from its angle function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4464729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can you recognize the shape of a figure from its shadows? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5178230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visual distinguishability of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can you see the bubbles in a foam? / rank
 
Normal rank

Latest revision as of 13:05, 24 July 2024

scientific article
Language Label Description Also known as
English
Finding needles in a haystack
scientific article

    Statements

    Finding needles in a haystack (English)
    0 references
    10 February 2021
    0 references
    A multicurve \(r\) in \(\mathbb{R}^2\) is a finite set of differentiable curves \(r_j\) with finite length and such that they do not intersect each other in open arc. \(r\) is regular if it verifies some standard characteristics, among others not to be self-intersecting or to be parametrized by arc-length on a finite closed interval. The trace \(Tr(r)\) of \(r\) is the set of points that are in the range of \(r\). Let us consider a circle rounding \(r\) and \(u_{\alpha}\) a parametrization of the circle. The masking function \(M_r:\mathbb{R}^2\rightarrow \mathbb{R}\) of \(r\) assigns the following number to any \(x\in \mathbb{R}^2\): \[ M_r(x)=\int_0^{\pi} \mu[Tr(r) \cap l(x,u_{\alpha})]\, d\alpha, \] where \(l(x,u_{\alpha})\) is the line through the point \(x\) with direction \(u_{\alpha}\), and \(\mu[\cdot]\) is the counting measure. Let \(r\) be a regular multicurve made of pieces of curves of class \(C^{\infty}\). The authors prove that the non-degenerate segments contained in \(Tr(r)\) can be reconstructed if the masking function is given on any rounding circle (Theorem 4.1). This implies that every segment of the piecewise \(C^{\infty}\) boundary of a convex domain \(D\) is determined by the visual angle function of \(D\) given on a surrounding circle (Corollary 4.2).
    0 references
    visual angle
    0 references
    masking function
    0 references
    polygon
    0 references
    regular multicurve
    0 references
    0 references

    Identifiers