algorithm - Smallest circle which covers given points on 2D plane -


problem: what smallest possible diameter of circle covers given n points on 2d plane?

what efficient algorithm solve problem , how work?

this smallest circle problem. see references links suggested algorithms.

e.welzl, smallest enclosing disks (balls , ellipsoids), in h. maurer (ed.), new results , new trends in computer science, lecture notes in computer science, vol. 555, springer-verlag, 359–37 (1991)

is reference "fastest" algorithm.


Comments

Popular posts from this blog

javascript - Enclosure Memory Copies -

php - Replacing tags in braces, even nested tags, with regex -