Hitting simplices with points in R^3

DOI10.1007/S00454-010-9263-2MaRDI QIDQ603863zbMATH OpenOpenAlexFDO

Authors Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfraz Raza

Publication date 8 November 2010

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-010-9263-2

zbMATH Keywords

discrete geometryselection lemmasimplex

Mathematics Subject Classification ID

Convex sets without dimension restrictions (aspects of convex geometry) (52A05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial complexity of geometric structures (52C45)

Review text

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.

Recommendations

• A new characterization of three-dimensional simple points
• scientific article; zbMATH DE number 2079713
• A concise characterization of 3D simple points
• Counting simplexes in \(\mathbb{R}^3\)
• Finding simplices containing the origin in two and three dimensions
• Regular simplices in three-dimensional normed spaces
• Geometric Set Cover and Hitting Sets for Polytopes in R
• Similar simplices in a d-dimensional point set
• Simplices in the Euclidean ball

Cites work

• A generalization of Caratheodory's theorem
• A point in many triangles
• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
• Point Selections and Weak ε-Nets for Convex Hulls
• Stabbing simplices by points and flats
• The number of triangles covering the center of an \(n\)-set

Cited in

(16)

• Counting simplexes in \(\mathbb{R}^3\)
• A concise characterization of 3D simple points
• Homogeneous selections from hyperplanes
• A proof of the Oja depth conjecture in the plane
• Selection lemmas for various geometric objects
• \(k\)-centerpoints conjectures for pointsets in \(\mathbb{R}^d\)
• A new characterization of three-dimensional simple points
• A new lower bound based on Gromov's method of selecting heavily covered points
• Minimum number of affine simplices of given dimension
• Hitting and Piercing Rectangles Induced by a Point Set
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Improving the first selection lemma in \(\mathbb{R}^3\)
• Homogeneous selections from hyperplanes
• On Gromov's method of selecting heavily covered points
• Bounds for Pach's selection theorem and for the minimum solid angle in a simplex
• Stabbing simplices by points and flats

This page was built for publication: Hitting simplices with points in \(\mathbb R^{3}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603863)