Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Let d(1) < d(2) < ... denote the set of all distances between two vertices of a convex n-gon. We show that the number of pairs of vertices at distance d(2) from one another is at most n + O(1). (C) 2013 Elsevier B.V. All rights reserved.