Rune <run### [at] mobilixnetdk> wrote:
: If I have a bunch of random 3-d vectors, is there a way I can find a new
: vector that is as close as possible to being perpendicular to as many as
: possible of the vectors?

  You could calculate the average of the normalized cross-products of all
pairs of vectors.

  If there's any word in that sentence which you didn't understand, drop me
a line and I'll explain (I can't know how well you know the terminology).

-- 
#macro N(D,I)#if(I<6)cylinder{M()#local D[I]=div(D[I],104);M().5,2pigment{
rgb M()}}N(D,(D[I]>99?I:I+1))#end#end#macro M()<mod(D[I],13)-6,mod(div(D[I
],13),8)-3,10>#end blob{N(array[6]{11117333955,
7382340,3358,3900569407,970,4254934330},0)}//                     - Warp -

Post a reply to this message