Jump to content

Talk:Heilbronn triangle problem

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Eluike (talk | contribs) at 21:15, 8 April 2022. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics GA‑class
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
GAThis article has been rated as GA-class on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's priority scale.

Comments

If we are posing the question of the worst case for the existence of small triangles, it will happen with all the chosen points on the boundary.

Might be true (in some sense, asymptotically) but I no longer find this at all evident. Another way to pose the question: for P, Q points from the configuration X, the line segment PG having length L, we want to draw strips of width inversely proportional to L and look whether any other point R lies in them (because the area of the triangle PQR is L times the perpendicular distance from R to the line).

Charles Matthews 09:35, 25 Sep 2004 (UTC)

Your GA nomination of Heilbronn triangle problem

Hi there, I'm pleased to inform you that I've begun reviewing the article "Heilbronn triangle problem" you nominated for GA-status according to the criteria. This process may take up to 7 days. Feel free to contact me with any questions or comments you might have during this period. Eluike (talk) 19:43, 8 April 2022 (UTC)[reply]