Talk:Smallest enclosing circle problem
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.
- That would be fine for the 74 computer programming languages that posted code to actually generate those random numbers, but what of the other 700 computer programming languages that are on Rosetta Code? Besides, that would clutter up their code to have to include a generator for those random coördinates. But, I was thinking of around a thousand coördinates, and they needn't be random at all (just appear to be random for the purposes of this task), they should be easily generated and with a small amount of uncomplicated/simple code. 10,000 points seems to bit of an overkill (not to mention a fair chunk of the number of comparisons, albeit there would be ways to optimize the search), where a 1,000 points would serve just as well for the purposes of this task. After all, the whole point would be to use the exact same coördinates, and they don't have to be random (or even unique, for that matter). -- Gerard Schildberger (talk) 16:06, 3 November 2020 (UTC)