Math “expert” wanted… Algorithm for finding line of two crossing areas 1

[d00ape]

I’m going to create a shape-class containing a lot of flat polygon areas.
I will make it possible to subtract one shape from another and then I need an algorithm to se if two polygon-areas in the 3D-space crosses each other, and if in which line the crossing is.

I see there should bee some kind of linear algebra calculations but I do not really know how to start constructing my c++ shape classes.

 

[ronnyjljr]

Go to college, you'll find your self computing the shape algorithms in calculus 3 =)

Hehe,
Ron

/**************
Me: When will the project be finished?
Them: What project?
Me: The one you have been working on for the last 3 years!
Them: Ohh, we can't finish it?
Me: Why?
Them: We don't know how to program...

 

[d00ape]

I've been on collage and therefore know the fastest way is to find someone already done what I searches. Why invent the weal twice…?

 

[Salem]

How about

http://www.faqs.org/faqs/graphics/algorithms-faq/

--

 

[d00ape]

A lot to search trough but thanks!!!