Small distances in convex polygons
Moric, Filip
2013

Abstract

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.

Details

Title Small distances in convex polygons
Author(s) Moric, Filip
Published in Discrete Mathematics
Pagination 16
Volume 313
Issue 18
Pages 1767-1782
Date 2013
Publisher Amsterdam, Elsevier Science Bv
ISSN 0012-365X
Keywords
DOI https://doi.org/10.1016/j.disc.2013.05.007
Other identifier(s) View record in Web of Science
Laboratories DCG
Record Appears in Scientific production and competences > SB - School of Basic Sciences > SB Archives > DCG - Chair of Combinatorial Geometry
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date 2013-10-01