xeronix's blog

By xeronix, 10 years ago, In English

Does anyone know any online judge problem which deals with Volume of Union of Cuboids ?

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By xeronix, 12 years ago, In English

I have solved closest pair and closest triplet problems using divide and conquer. I wonder if there is a problem ever asked which deals with finding closest quadruplet of points ( sum of distance between all pairs is minimum ) ? Also i want some efficient approach for solving similar problem for k-closest points.

Full text and comments »

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

By xeronix, 12 years ago, In English

Here is my code for the problem : http://ideone.com/UHbff

I got WA because on Codeforces judge for input 1 10000, its giving 10007 but on ideone and my system it gives 10008. Am i using any compiler version dependent statement ?

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By xeronix, 13 years ago, In English
Is centre of minimum enclosing sphere the answer to this problem ??

If yes then considering x and y coordinates only, can't we find minimum enclosing circle's centre and then somehow search for required z coordinate because min_z <= z <= max_z .
min_z = min. z coordinate in given set of points
max_z = max. z_coordinate in given set of points


Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By xeronix, 14 years ago, In English

Can anyone explain the algorithm to solve area of union of circles problem( given n circles + centre and radius of each)

Thankyou

Full text and comments »

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