Trapezoids and Deltoids in Wide Planar Point Sets

We call a set of n points in the Euclidean plane “wide” if at most n of its points are collinear. We show that in such sets, the maximum possible number of trapezoids is Ω ( n 3 log n ) and O ( n 3 log 2 n ) while for deltoids we have Ω ( n 5 / 2 ) and O ( n 8 / 3 log n ) .

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2019-05, Vol.35 (3), p.569-578
1. Verfasser:	Elekes, Gy
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Engineering Design Euclidean geometry Mathematics Mathematics and Statistics Original Paper Trapezoids
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!