Point Selections and Weak ε-Nets for Convex Hulls (Q4291196): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q101133139, #quickstatements; #temporary_batch_1719448105926
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of halving planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Points and triangles in the plane and halving planes in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of Radon's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning with two lines in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On empty triangles determined by points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal problems of graphs and generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of triangles covering the center of an \(n\)-set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Caratheodory's theorem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q101133139 / rank
 
Normal rank

Latest revision as of 02:41, 27 June 2024

scientific article; zbMATH DE number 563579
Language Label Description Also known as
English
Point Selections and Weak ε-Nets for Convex Hulls
scientific article; zbMATH DE number 563579

    Statements

    Point Selections and Weak ε-Nets for Convex Hulls (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 May 1994
    0 references
    0 references
    weak \(\varepsilon\)-net problem
    0 references
    convex hulls
    0 references
    point selection problem
    0 references
    hitting set problem
    0 references
    0 references