H0ngJun7's blog

By H0ngJun7, history, 16 months ago, In English,
  1. Smallest Enclosing Circle : 2-Dimension Problem (Written in Korean. Output is the smallest enclosing circle's position on the first line and the radius on the second line.)

  2. Smallest Enclosing Sphere : 3-Dimension Problem

Thesis Link

Let P(X, Y, Z) = (Average(x(i)), Average(y(i)), Average(z(i)))

Average(x(i)) = Sum(x(i)) / N

Average(y(i)) = Sum(y(i)) / N

Average(z(i)) = Sum(z(i)) / N

P is inside of the points' convex hull.

Now find the farthest point(M) to P.

Move P toward M a little bit and the ratio should be small and decreasing.

If there is no such a movement, that is the answer.

Total Time Complexity is O(N * constant number)

(We can reduce 'N' by getting convex hull.)

My 2-Dimension Problem's Solution Code

My 3-Dimension Problem's Solution Code

 
 
 
 
  • Vote: I like it  
  • +55
  • Vote: I do not like it  

»
16 months ago, # |
  Vote: I like it +5 Vote: I do not like it
  • »
    »
    16 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    The 3-Dimension Problem I linked is this. Thanks.

»
5 months ago, # |
  Vote: I like it -45 Vote: I do not like it

Could you please explain the code for 2D ??