Recent content by Spiderman

Alright. I figured it out. for new point a_1^n 1. calculate the difference between vertices d_1=|a_1b_1|-|a_2b_2| d_2=|a_1c_1|-|a_2c_2| 2. a_1^n=a_2+(d_1/2*\vec{u_1})+(d_2/2*\vec{u_2}) where \vec{u_1}=a2-b2 and \vec{u_2}=a2-c2 3. repeat for other two points of triangle.

Is this a question or a statement? If it is a question, do you need help or are you offering it? If it is a statement, I don't know what it means.

At first I thought this was a totally absurd question, because in many programming languages "!=" means "not equal to". Of course 0 is not equal to 1 I've been programming all weekend so everything else goes out the door.

Thanks for the suggestions. I've used those techniques and they are too slow. I say a few thousand, but I suppose in actuality I mean something on the order or billions or more. Each instance of the program will currently take about 5 seconds, with maybe 10,000 triangles overlays amongst other...

Oh yes. I want to rotate and translate one triangle so that it fits as best as possible over the other. I know ways of doing this, but they all involve too much in the way of computation. I'm sure there is a quick way but my brain won't come up with it.

If I have two triangles in three dimensions with vertices a1,b1,c1 and a2,b2,c2, and want to overlay them such that the distance between corresponding verticies is minimized, i.e. such that the total distance between the sum of the distances between the vertices a1-a2, b1-b2 and c1-c2 are...

This may be a simple problem, but I wanted to run it by some other people before using my solution. I have two distinct sets of items A and B which may or may not be connected to one another. I want to know whether or not the interconnections between them are significiantly different, i.e are...