Classification of seven-point four-distance sets in the plane
From MaRDI portal
(Redirected from Publication:351648)
A point set \(X\) in the Euclidean plane is called a \(k\)-distance set if there are exactly \(k\) different distances between two distinct points in \(X.\) Two planar sets are called isomorphic if there exists a similar transformation from one to the other. The main result of the paper states that there are only \(42\) seven-point four distance sets in the plane up to isomorphism. All these sets are shown in a figure.
Recommendations
- Classification of isosceles 7-point 3-distance sets in 3-dimensional Euclidean space
- On the relative distances of seven points in a plane convex body
- On seven points in the boundary of a plane convex body in large relative distances
- About convex 4-isosceles 7-point sets
- Convex independent sets and 7-holes in restricted planar point sets
- scientific article; zbMATH DE number 4065166
- scientific article; zbMATH DE number 6107252
- Distinct distances in planar point sets with forbidden 4-point patterns
- Deformation classification of typical configurations of 7 points in the real projective plane
- Four-connected triangulations of planar point sets
Cites work
- Classification of three-distance sets in two dimensional Euclidean space
- Convex nonagons with five intervertex distances
- Convex polygons with few intervertex distances
- scientific article; zbMATH DE number 6107252 (Why is no real title available?)
- Maximum planar sets that determine k distances
- Uniqueness of maximum planar five-distance sets
Cited in
(5)
This page was built for publication: Classification of seven-point four-distance sets in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q351648)
