Talk:Smallest enclosing circle problem

From Rosetta Code

task wording

Did you mean to say   2-dimensional space instead of   n-dimensional space?     -- Gerard Schildberger (talk) 22:58, 2 November 2020 (UTC)


3-dimensional space would require a sphere to contain a given set of points.     -- Gerard Schildberger (talk) 22:58, 2 November 2020 (UTC)


4-dimensional space would require a hypersphere (or glome) to contain a given set of points.     -- Gerard Schildberger (talk) 22:58, 2 November 2020 (UTC)


Any Dr. Who fans around or anyone who owns a TARDIS?     -- Gerard Schildberger (talk) 23:03, 2 November 2020 (UTC)


list of points

I think it would be a good idea to provide a sample list of a good-sized chunk of points (maybe even two sets) so programmers can use the same data and have something to compare/validate against.     -- Gerard Schildberger (talk) 00:00, 3 November 2020 (UTC)

How about using http://rosettacode.org/wiki/Linear_congruential_generator and create i= 1 to n: generate (i* random x| i*random ) coordinates.So one can test ex. 10000 points. in a (n x n) square.

Horst.h Horst.h (talk) 08:40, 3 November 2020 (UTC)

Retrieved from "https://rosettacode.org/wiki/Talk:Smallest_enclosing_circle_problem?oldid=303513"