On the Fermat-Weber Point of a Polygonal Chain

preprint2012arXivOpen access

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 kk-chain of a regular nn-gon is the segment of the boundary of the regular nn-gon formed by a set of k(≤n)k(\leq n) consecutive vertices of the regular nn-gon. We show that for every odd positive integer kk, there exists an integer N(k)N(k), such that the Fermat-Weber point of a set of kk fixed points lying on the vertices a kk-chain of a nn-gon coincides with a vertex of the chain whenever n≥N(k)n\geq N(k). We also show that ⌈πm(m+1)−π2/4⌉≤N(k)≤⌊πm(m+1)+1⌋\lceilπm(m+1)-π^2/4\rceil \leq N(k) \leq \lfloorπm(m+1)+1\rfloor, where k(=2m+1)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(hklog⁡k)O(hk\log k) time algorithm for determining whether a given set of kk points, having hh points on the convex hull, belongs to such a family.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.