[comp.theory] A couple of questions for computational geometers

icsrc@NERO.CS.MONTANA.EDU (Rob Cimikowski) (09/25/90)

1) Given a set of points in 3-dimensional space, what is the maximum
   number which can be mutually equidistant? (is it 4?) Can the answer
   be generalized for n dimensions?

2) Are there any good algorithms for finding a maximum set of
   mutually equidistant points in 3 dimensions, that is, better than the
   brute-force O(n**4) method of looking at all possible
   subsets of 4 points?

If any algorithms are known, I would appreciate references.

Thanks,

Bob Cimikowski
Montana St Univ
icsrc@caesar.cs.montana.edu