The 2-Center Problem in Three Dimensions

Details The 2-Center Problem in Three Dimensions The 2-Center Problem in Three Dimensions

2010-12-13

arxiv.org/abs/1012.2694v1

Computer Science

Computational Geometry

Scientific paper

Let P be a set of n points in R^3. The 2-center problem for P is to find two congruent balls of minimum radius whose union covers P. We present two randomized algorithms for computing a 2-center of P. The first algorithm runs in O(n^3 log^5 n) expected time, and the second algorithm runs in O((n^2 log^5 n) /(1-r*/r_0)^3) expected time, where r* is the radius of the 2-center balls of P and r_0 is the radius of the smallest enclosing ball of P. The second algorithm is faster than the first one as long as r* is not too close to r_0, which is equivalent to the condition that the centers of the two covering balls be not too close to each other.

Affiliated with

Also associated with

No associations

Rating

The 2-Center Problem in Three Dimensions 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 The 2-Center Problem in Three Dimensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The 2-Center Problem in Three Dimensions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26987