On visibility problems with an infinite discrete set of obstacles (Q2046440): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3120778062 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1805.11679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Far Can You See in a Forest? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polya's Orchard Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly Discrete Forests with Poor Visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set containing rectifiable arcs QC-locally but not QC-globally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Euclidean Ramsey theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The forest hiding problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets with Prescribed Projections and Nikodym Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orchard visibility problem and some variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense forests and Danzer sets / rank
 
Normal rank

Latest revision as of 10:56, 26 July 2024

scientific article
Language Label Description Also known as
English
On visibility problems with an infinite discrete set of obstacles
scientific article

    Statements

    On visibility problems with an infinite discrete set of obstacles (English)
    0 references
    0 references
    18 August 2021
    0 references
    visibility problems
    0 references
    growth rate
    0 references
    dark forest
    0 references
    dual-danzer problem
    0 references
    geometric Ramsey theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references