Optimal point sets determining few distinct triangles
From MaRDI portal
Abstract: We generalize work of Erdos and Fishburn to study the structure of finite point sets that determine few distinct triangles. Specifically, we ask for a given , what is the maximum number of points that can be placed in the plane to determine exactly distinct triangles? Denoting this quantity by , we show that , , and for all . We also completely characterize the optimal configurations for .
Recommendations
Cites work
- A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
- scientific article; zbMATH DE number 3906412 (Why is no real title available?)
- Maximum planar sets that determine k distances
- On Sets of Distances of n Points
- On the Erdős distinct distances problem in the plane
- On triangles determined by subsets of the Euclidean plane, the associated bilinear operators and applications to discrete geometry
- Research Problems in Discrete Geometry
- Uniqueness of maximum planar five-distance sets
Cited in
(8)- Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
- Convex polyhedra in \(\mathbb{R}^3\) spanning \(\Omega(n^{4/3})\) congruent triangles
- Characterizing optimal point sets determining one distinct triangle
- scientific article; zbMATH DE number 7342428 (Why is no real title available?)
- OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS
- Optimal point sets determining few distinct angles
- A structural theorem for sets with few triangles
- On Optimal Point Sets Determining Distinct Triangles
This page was built for publication: Optimal point sets determining few distinct triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384222)