okay, so here is a problem I have long been thinking of. Its basically an extension to an (probably) well known problem, taking it from one dimension to another.

First the two-dimensional version, a warming up so to speek:
Given three concurrent lines on a plane (so they have all have a point in common), find an equilateral triangle so that on each line is a corner of the triangle.
The solution is rather simple, if the trick for solving it is known. Overwise its quite hard (Tip: rotate)

Okay, so here the more complex versions of the problem:

Given three concurrent lines in space find such an triangle.
(sadly rotating is not as easy when there is no trivial axis to rotate)
and

Given four points in space, what are the restrictions for a point and a regular tetrahedron, so that the projection of the vertices of tetrahedron from this point results in these four points. Or the other way around: Is it possible to construct a regular tetrahedron so that the four lines, connecting one point of these four given points with one vertex of the tetrahedron, intersect in one point, and what are the restrictions of this problem.

Note that the first of these problems is equivalent to solve this equation system:
a² + b² + a b k₁ = 1
b² + c² + b c k₂ = 1
c² + a² + c a k₃ = 1
for given k₁, k₂, k₃ (simply set the size of the triangle to one and use the law of cosines).

Inputing this into maple gives some horrifying results   (okay, im a n00b with maple, but still).

Maybe someone has an idea how to solve this.