Hitting simplices with points in \(\mathbb R^{3}\) (Q603863): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Point Selections and Weak ε-Nets for Convex Hulls / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A generalization of Caratheodory's theorem / 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 point in many triangles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stabbing simplices by points and flats / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4530626 / rank | |||
Normal rank |
Latest revision as of 11:26, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hitting simplices with points in \(\mathbb R^{3}\) |
scientific article |
Statements
Hitting simplices with points in \(\mathbb R^{3}\) (English)
0 references
8 November 2010
0 references
It is obtained that for a set \(P\) of \(n\) points in \(\mathbb{R}^3\) there exists a point contained in at least \(0.00227n^4\) simplices spanned by vertices from \(P\). The authors claim that the factor of \(0.00227\) improves the previously known estimate by a factor of 1.4.
0 references
discrete geometry
0 references
selection lemma
0 references
simplex
0 references