Talk:Smallest enclosing circle problem: Difference between revisions
Content added Content deleted
No edit summary |
|||
Line 11: | Line 11: | ||
Any Dr. Who fans around or anyone who owns a TARDIS? -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:03, 2 November 2020 (UTC) |
Any Dr. Who fans around or anyone who owns a TARDIS? -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:03, 2 November 2020 (UTC) |
||
As long as we are using Euclidean space, isn't this just a matter of finding the largest distance between any 2 of the points and dividing by 2? The minumum radius center is the midpoint of the longest connecting line segment?? --[[User:Wherrera|Wherrera]] ([[User talk:Wherrera|talk]]) 23:38, 2 November 2020 (UTC) |
Revision as of 23:40, 2 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)