Distance k-Sectors Exist

Details Distance k-Sectors Exist Distance k-Sectors Exist

2009-12-21

arxiv.org/abs/0912.4164v1

Computational Geometry 43(9):713-720, November 2010

Computer Science

Computational Geometry

10 pages, 5 figures

Scientific paper

10.1016/j.comgeo.2010.05.001

The bisector of two nonempty sets P and Q in a metric space is the set of all points with equal distance to P and to Q. A distance k-sector of P and Q, where k is an integer, is a (k-1)-tuple (C_1, C_2, ..., C_{k-1}) such that C_i is the bisector of C_{i-1} and C_{i+1} for every i = 1, 2, ..., k-1, where C_0 = P and C_k = Q. This notion, for the case where P and Q are points in Euclidean plane, was introduced by Asano, Matousek, and Tokuyama, motivated by a question of Murata in VLSI design. They established the existence and uniqueness of the distance trisector in this special case. We prove the existence of a distance k-sector for all k and for every two disjoint, nonempty, closed sets P and Q in Euclidean spaces of any (finite) dimension, or more generally, in proper geodesic spaces (uniqueness remains open). The core of the proof is a new notion of k-gradation for P and Q, whose existence (even in an arbitrary metric space) is proved using the Knaster-Tarski fixed point theorem, by a method introduced by Reem and Reich for a slightly different purpose.

Affiliated with

Also associated with

No associations

Rating

Distance k-Sectors Exist does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distance k-Sectors Exist, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance k-Sectors Exist will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-302554