On the Fermat-Weber Point of a Polygonal Chain

Abstract

In this paper, we study the properties of the Fermat-Weber point for a set of fixed points, whose arrangement coincides with the vertices of a regular polygonal chain. A k-chain of a regular n-gon is the segment of the boundary of the regular n-gon formed by a set of k(≤ n) consecutive vertices of the regular n-gon. We show that for every odd positive integer k, there exists an integer N(k), such that the Fermat-Weber point of a set of k fixed points lying on the vertices a k-chain of a n-gon coincides with a vertex of the chain whenever n≥ N(k). We also show that π m(m+1)-π2/4 ≤ N(k) ≤ π m(m+1)+1, where k (=2m+1) is any odd positive integer. We then extend this result to a more general family of point set, and give an O(hk k) time algorithm for determining whether a given set of k points, having h points on the convex hull, belongs to such a family.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…