Advertisement

Distances in Convex Polygons

  • Peter Fishburn
Part of the Algorithms and Combinatorics book series (AC, volume 14)

Summary

One of Paul Erdős’s many continuing interests is distances between points in finite sets. We focus here on conjectures and results on intervertex distances in convex polygons in the Euclidean plane. Two conjectures are highlighted. Let t(x) be the number of different distances from vertex x to the other vertices of a convex polygon C, let T(C) = Σt(x), and take T n = min{T(C) : C has n vertices}. The first conjecture is \(T_n = \left( {_2^n } \right)\). The second says that if \(T\left(C\right) = \left( {_2^n } \right)\) for a convex n-gon, then the n-gon is regular if n is odd, and is what we refer to as bi-regular if n is even. The conjectures are confirmed for small n.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E. Altman, On a problem of P. Erdős, Amer. Math. Monthly 70 (1963) 148–157.MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    H. Edelsbrunner and P. Hajnal, A lower bound on the number of unit distances between the vertices of a convex polygon, J. Combin. Theory A 56 (1991) 312–316.MathSciNetCrossRefGoogle Scholar
  3. 3.
    P. Erdős, On sets of distances of n points, Amer. Math. Monthly 53 (1946) 248–250.MathSciNetCrossRefGoogle Scholar
  4. 4.
    P. Erdős and P. Fishburn, Multiplicities of interpoint distances in finite planar sets, Discrete Appl. Math, (to appear).Google Scholar
  5. 5.
    P. Erdős and P. Fishburn, Intervertex distances in convex polygons, Discrete Appl. Math, (to appear).Google Scholar
  6. 6.
    P. Erdős and P. Fishburn, A postscript on distances in convex n-gons, Discrete Comput. Geom. 11 (1994) 111–117.MathSciNetCrossRefGoogle Scholar
  7. 7.
    P. Erdős and L. Moser, Problem 11, Canad. Math. Bull. 2 (1959) 43.Google Scholar
  8. 8.
    P. Fishburn, Convex polygons with few intervertex distances, DIM ACS report 92–18 (April 1992), AT&T Bell Laboratories, Murray Hill, NJ.Google Scholar
  9. 9.
    P. Fishburn, Convex polygons with few vertices, DIMACS report 92–17 (April 1992), AT&T Bell Laboratories, Murray Hill, NJ.Google Scholar
  10. 10.
    P. C. Fishburn and J. A. Reeds, Unit distances between vertices of a convex polygon, Comput. Geom.: Theory and Appls. 2 (1992) 81–91.MathSciNetMATHGoogle Scholar
  11. 11.
    Z. Fiiredi, The maximum number of unit distances in a convex n-gon, J. Combin. Theory A 55 (1990) 316–320.CrossRefGoogle Scholar
  12. 12.
    L. Moser, On the different distances determined by n points, Amer. Math. Monthly 59 (1952) 85–91.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Peter Fishburn
    • 1
  1. 1.AT&T Bell LaboratoriesMurray HillUSA

Personalised recommendations