A combinatorial result about points and balls in Euclidean space
Es wird folgendes Resultat bewiesen: Sei X eine endliche Teilmenge des d- dimensionalen euklidischen Raumes. Dann gibt es eine Teilmenge A von X mit \(| A| \leq [0.5(d+3)]\) Punkten und eine Konstante \(c_ n>0\) mit folgender Eigenschaft: Jeder A enthaltende d-Ball enthält mindestens \(c_ n| X|\) Punkte von X. Das Resultat verallgemeinert den Fall \(d=2\) von \textit{V. Neumann} und dem letzten Autor in Discrete Math. 69, No.2, 113-178 (1988; Zbl 0645.05024), welche \(c_ 2\geq 1/60\) gezeigt haben. Diese Schranke ist von \textit{R. Hayward} [Discrete Comput. Geom. 4, No.3, 263-264 (1989; s. vorangehendes Referat)] auf \(c_ 2\geq 5/84\) verbessert worden. Die Autoren zeigen, daß die Schranke \(0.5(d+3)\) für die Anzahl der Elemente von A nicht verbessert werden kann: Es gibt sogar eine unendliche Teilmenge X des \({\mathbb{R}}^ n\), so daß für alle \(A\subset X\) mit \(| A| <[(d+3)]\) ein d-Ball mit \(B\cap X=A\) existiert.
- A combinatorial result on points and circles on the plane
- A combinatorial property of points and ellipsoids
- On combinatorial properties of spheres in euclidean spaces
- A combinatorial property of points and balls, a colored version
- On intersecting a point set with Euclidean balls
- scientific article; zbMATH DE number 4212059
- Set theoretic, measure theoretic, combinatorial, and number theoretic problems concerning point sets in Euclidean space
- Publication:3490647
- The number of extreme pairs of finite point-sets in Euclidean spaces
- scientific article; zbMATH DE number 815758
- Depth of segments and circles through points enclosing many points: A note
- A combinatorial result on points and circles on the plane
- Some extremal results on circles containing points
- A note on the circle containment problem
- Randomized incremental construction of Delaunay and Voronoi diagrams
- A combinatorial property of convex sets
- Containment problems in high-dimensional spaces
- On circles enclosing many points
- Matching points with disks with a common intersection
- A combinatorial property of points and balls, a colored version
- On Center Regions and Balls Containing Many Points
- On intersecting a point set with Euclidean balls
- On geodesic disks enclosing many points
- Polychromatic coloring of tuples in hypergraphs
- On combinatorial properties of spheres in euclidean spaces
- A combinatorial property of points and ellipsoids
This page was built for publication: A combinatorial result about points and balls in Euclidean space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120834)
