Topic: Themes for new topics -={Challenge}=-

[Jeremy]

Looking for a fun challenge? How about this one. Write an algorithm for finding the minimal circle that will just enclose a set of circles of random radii and random centers. You are not allowed to approximate the circles with points but must use the circle data. Of course we assume that all the circles lie on the XY-plane.

Similar to an Apollonian Gasket, but the internal circles can intersect each other?

Yes, the circles can cross each other. It seems however that everyone is chasing the nearest point now, a separate challenge for another day?

[Mark]

I like these type of challenges. Although that particular one is not all that great.

[CAB]

I think it is necessary to give a full description of what and how the program is supposed to do.

I need a faster version of this:

Code: [Select]

(defun nearest-point (pt ptlst / mindst dst npt)
  (setq npt (car ptlst)
        mindst (distance2d npt pt))
  (foreach p (cdr ptlst)
    (if (< (setq dst (distance2d p pt)) mindst)
      (setq mindst dst
            npt p)))
  npt)


http://www.theswamp.org/index.php?topic=40592.msg474213#msg474213

[Jeff H]

Project Euler
TopCoder
Google Code Jam
CodeKata

[CAB]

Interesting links Jeff 

[ElpanovEvgeniy]

CodeKata

Thank you!
That's what I think!