Danzer's problem, effective constructions of dense forests and digital sequences (Q6074969): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Around the Danzer problem and the construction of dense forests / 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: Cut‐and‐project quasicrystals, lattices and dense forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly Discrete Forests with Poor Visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Danzer / 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: Well dispersed sequences in \([0,1]^{d}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences, discrepancies and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequence Well Dispersed in the Unit Square / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a method of constructing well-dispersed sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems of Danzer and Gowers and Dynamics on the Space of Closed Subsets of ${\mathbb{R}}^d$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense forests and Danzer sets / rank
 
Normal rank

Revision as of 23:58, 2 August 2024

scientific article; zbMATH DE number 7740357
Language Label Description Also known as
English
Danzer's problem, effective constructions of dense forests and digital sequences
scientific article; zbMATH DE number 7740357

    Statements

    Identifiers

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