Talk:Smallest enclosing circle problem: Difference between revisions
m (added another talk section.) |
m (→list of points) |
||
Line 16: | Line 16: | ||
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. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 00:00, 3 November 2020 (UTC) |
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. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk: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. |
|||
[[User:Horst.h|Horst.h]] [[User:Horst.h|Horst.h]] ([[User talk:Horst.h|talk]]) 08:40, 3 November 2020 (UTC) |
Revision as of 08:42, 3 November 2020
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.