Hey there,
I'm looking for some vocabulary to look up a problem. I'm sure this is an established problem, but I don't know what it would be called:
I have an ID. It is made up of N numbers: { 1, 6, 3, 19 }
I then have another ID. It is made up of the same quantity N numbers { 7, 3, 2, 9 }
I then have many more of these IDs. ID#1, ID#2, ID#3, etc.
I want to make a bound of a set of IDs, such that the bound will be the minimum "hyper-sphere?" which will contain the IDs.
I believe I should be able to calculate the center of each of N numbers, and calculate the radius of each of N numbe…