Photo from archive.org
We call a set of n points in the Euclidean plane “wide” if at most $$\sqrt{n}$$n of its points are collinear. We show that in such sets, the maximum possible… Click to show full abstract
We call a set of n points in the Euclidean plane “wide” if at most $$\sqrt{n}$$n of its points are collinear. We show that in such sets, the maximum possible number of trapezoids is $$\;\Omega (n^{3}\log n)$$Ω(n3logn) and $$O(n^{3}\log ^2 n)$$O(n3log2n) while for deltoids we have $$\;\Omega (n^{5/2})$$Ω(n5/2) and $$O(n^{8/3}\log n)$$O(n8/3logn).
Keywords:
wide planar;
deltoids wide;
planar point;
trapezoids deltoids;
point sets
Journal Title: Graphs and Combinatorics
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Graphs and Combinatorics
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!