On the Fermat-Weber Point of a Polygonal Chain

TL;DR

This paper investigates the Fermat-Weber point for points on regular polygonal chains, establishing conditions under which it coincides with a chain vertex and providing an efficient algorithm for related point set classification.

Contribution

It proves that for odd-length chains, the Fermat-Weber point aligns with a chain vertex beyond a certain polygon size and offers an algorithm to identify specific point set families.

Findings

Fermat-Weber point coincides with a chain vertex for large enough polygons.

Bounds on the polygon size N(k) for the Fermat-Weber point to align with a vertex.

An O(hk log k) algorithm to classify point sets within a family.

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(\leq 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\geq N(k)$. We also show that $\lceil\pi m(m+1)-\pi^2/4\rceil \leq N(k) \leq \lfloor\pi m(m+1)+1\rfloor$, 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\log k)$ time algorithm for determining whether a given set of $k$ points, having $h$ points on the convex hull, belongs to such a family.