Repeated angles in the plane and related problems
From MaRDI portal
Publication:1185877
DOI10.1016/0097-3165(92)90094-BzbMath0749.52014OpenAlexW2002417698MaRDI QIDQ1185877
Publication date: 28 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(92)90094-b
Analysis of algorithms and problem complexity (68Q25) Erd?s problems and related topics of discrete geometry (52C10)
Related Items
On the number of unit-area triangles spanned by convex grids in the plane, The Szemerédi-Trotter theorem in the complex plane, A semi-algebraic version of Zarankiewicz's problem, Point sets with distinct distances, An improved bound on the number of unit area triangles, Incidences of cubic curves in finite fields, Distinct angle problems and variants, Angle chains and pinned variants, On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space, Distinct Distances on Algebraic Curves in the Plane, Unnamed Item, A note on distinct distance subsets, An incidence theorem in higher dimensions, A combinatorial problem on polynomials and rational functions, A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?, Minimum planar sets with maximum equidistance counts, On the number of similar instances of a pattern in a finite set, Schwartz-Zippel bounds for two-dimensional products, On the restriction problem for discrete paraboloid in lower dimension, The grid revisited, Trapezoids and deltoids in wide planar point sets, Triangle areas in line arrangements, Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique, Vapnik-Chervonenkis density in some theories without the independence property, I, The number of unit-area triangles in the plane: theme and variation, Point-curve incidences in the complex plane, Extension theorems and a connection to the Erdős-Falconer distance problem over finite fields, A Szemerédi-Trotter type theorem in \(\mathbb R^4\), Counting rectangles and an improved restriction estimate for the paraboloid in $F_p^3$, A new bound for the Erdős distinct distances problem in the plane over prime fields, Cutting lemma and Zarankiewicz's problem in distal structures, Extremal problems on triangle areas in two and three dimensions, A note on a problem of Erdős on right angles, Convexity and sumsets, Distinct distances determined by subsets of a point set in space, The proof of the \(l^2\) decoupling conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Locating a robot with angle measurements
- Variations on the theme of repeated distances
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- Extremal problems in discrete geometry
- Unit distances
- Finding squares and rectangles in sets of points
- Combinatorial complexity bounds for arrangements of curves and spheres
- Repeated angles in \(E_ 4\)
- Applications of random sampling in computational geometry. II
- On the Distribution of Values of Angles Determined by Coplanar Points
- A Problem of Leo Moser About Repeated Distances on the Sphere
- On Some Applications of Graph Theory to Geometry
- Some Geometrical Thoughts II
- On Sets of Distances of n Points
- Some extremal problems in geometry
