Path: utzoo!attcan!uunet!decwrl!ucbvax!NERO.CS.MONTANA.EDU!icsrc
From: icsrc@NERO.CS.MONTANA.EDU (Rob Cimikowski)
Newsgroups: comp.theory
Subject: A couple of questions for computational geometers
Message-ID: <9009201710.AA07907@nero.cs.montana.edu>
Date: 25 Sep 90 15:32:28 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: Rob Cimikowski <icsrc%nero.cs.montana.edu@VM1.NoDak.EDU>
Lines: 16

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