Publication

Small distances in convex polygons

Filip Moric
2013
Journal Articles

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.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Small distances in convex polygons

Chat with Graph Search

Voxel-Wise Brain Graphs From Diffusion MRI: Intrinsic Eigenspace Dimensionality and Application to Functional MRI

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

Dynamical system approach to navigation around obstacles