Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!uakari.primate.wisc.edu!dali.cs.montana.edu!nero!icsrc
From: icsrc@nero.cs.montana.edu (Rob Cimikowski)
Newsgroups: comp.theory
Subject: comp. geometry
Message-ID: <2473@dali>
Date: 24 Sep 90 21:03:31 GMT
Sender: usenet@dali.cs.montana.edu
Organization: Montana State University, Dept. of Computer Science, Bozeman
Lines: 18

A couple of questions for computational geometers:

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