generalization of tetrahedron

Question

I just want to know how to locate n+1 points in n dimensional real space such that the distance between any two points is 1 e.g. can you guys help me please?

I think http://en.wikipedia.org/wiki/Simplex should be able to help you out. — Ian Coley, Mar 20 '13 at 17:01
This describes the general format of the solid whose vertices are exactly the set you describe. The edges are of course wrong. Maybe http://en.wikipedia.org/wiki/5-cell looks better for your purposes? — Ian Coley, Mar 20 '13 at 17:11
It's easier to locate the n+1 points in a hyperplane in n+1 dimensional space. — Johannes, Mar 20 '13 at 17:42

score 2 · Answer 1 · edited Apr 13 '17 at 12:19

2

You might check the proof of

Cartesian coordinates for vertices of a regular 16-simplex?

for a formula for the regular simplex vertices

edited Apr 13 '17 at 12:19

Community

1

answered Jul 27 '15 at 21:17

andre

1,284

score 1 · Answer 2 · answered Mar 20 '13 at 17:28

1

In the Wikipedia article under "Cartesian coordinates for regular n-dimensional simplex in R$^n$" a process is described that results in just this. It works in any dimension.

answered Mar 20 '13 at 17:28

Ross Millikan

374,822

generalization of tetrahedron

2 Answers2