Distinct Angles and Angle Chains in Three Dimensions
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to find the minimum number of distinct distances between pairs of points selected from any configuration of $n$ points in the plane. The problem has since been explored along with many variants, including ones that extend it into hi...
Main Authors: | Ruben Ascoli, Livia Betti, Jacob Lehmann Duke, Xuyan Liu, Wyatt Milgrim, Steven J. Miller, Eyvindur A. Palsson, Francisco Romero Acosta, Santiago Velazquez Iannuzzelli |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2023-02-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/10037/pdf |
Similar Items
-
On the density of sets of the Euclidean plane avoiding distance 1
by: Thomas Bellitto, et al.
Published: (2021-08-01) -
A new discrete theory of pseudoconvexity
by: Balázs Keszegh
Published: (2023-05-01) -
$K_{1,3}$-covering red and blue points in the plane
by: Bernardo M. Ábrego, et al.
Published: (2019-01-01) -
A Note on Flips in Diagonal Rectangulations
by: Jean Cardinal, et al.
Published: (2018-11-01) -
The Flip Diameter of Rectangulations and Convex Subdivisions
by: Eyal Ackerman, et al.
Published: (2016-03-01)