2 citations · 3 across the 6 of their papers we have counts for
3 papers · 2 filters
Distinct Angle Problems and Variants
Henry L. Fleischmann, Hongyi B. Hu, Faye Jackson +4
The Erdős distinct distance problem is a ubiquitous problem in discrete geometry. Less well known is Erdős' distinct angle problem, the problem of finding the minimum number of dis…
Optimal Point Sets Determining Few Distinct Angles
Henry L. Fleischmann, Steven J. Miller, Eyvindur A. Palsson +2
We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For the largest size of a point set admitting at most angles, we prove $P(2)…
Angle chains and pinned variants
Eyvindur Ari Palsson, Steven Senger, Charles Wolf
We study a variant of the Erd\H os unit distance problem, concerning angles between successive triples of points chosen from a large finite point set. Specifically, given a large f…