Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the Fermat-Weber Point of a Polygonal Chain (1004.2958v3)

Published 17 Apr 2010 in math.MG and cs.CG

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)-\pi2/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.

Citations (3)

Summary

We haven't generated a summary for this paper yet.