Direction trees (Q1820788): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2912623622 / rank | |||
Normal rank |
Latest revision as of 11:15, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Direction trees |
scientific article |
Statements
Direction trees (English)
0 references
1987
0 references
A direction tree for a finite set X of points in the plane is a tree T whose vertices are the points of X such that any two edges of T determine lines with different slopes. Ungar's theorem says that any n noncollinear points in the real affine plane determine at least different n-1 slopes among connecting lines. This note uses Ungar's theorem plus Hall's theorem on distinct representatives to prove the existence of a direction tree for any finite set of noncollinear points.
0 references
direction tree
0 references
Ungar's theorem
0 references
Hall's theorem
0 references
noncollinear points
0 references