A point in many triangles

MaRDI QIDQ2500999zbMATH OpenFDO

Authors Boris Bukh

Publication date 30 August 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/130362, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1n10.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Review text

Summary: We give a simpler proof of the result of \textit{E. Boros} and \textit{Z. Füredi} [Geom. Dedicata 17, 69--77 (1984; Zbl 0595.52002)] that for any finite set of points in the plane in general position there is a point lying in \(2/9\) of all the triangles determined by these points.

Recommendations

• The number of triangles covering the center of an \(n\)-set
• On empty triangles determined by points in the plane
• Points and triangles in the plane and halving planes in space
• On the existence of ordinary triangles
• Point sets containing their triangle centers

Cited in

(18)

• Eppstein's bound on intersecting triangles revisited
• The number of triangles covering the center of an \(n\)-set
• A cellular triangle containing a specified point
• On the existence of ordinary triangles
• Extremal problems for pairs of triangles
• Intersection theorems for triangles
• Expander graphs -- both local and global
• Hypergraph expanders from Cayley graphs
• Many triangles with few edges
• Selection lemmas for various geometric objects
• scientific article; zbMATH DE number 1234827 (Why is no real title available?)
• A new lower bound based on Gromov's method of selecting heavily covered points
• A slight improvement to the colored Bárány's theorem
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Positive-fraction intersection results and variations of weak epsilon-nets
• Hitting simplices with points in \(\mathbb R^{3}\)
• Improved bounds for discrete Voronoi games
• Stabbing simplices by points and flats

This page was built for publication: A point in many triangles

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