Thread: ray casting

Yeah, I got in with only 1 year of programming experience. Supposedly you don't need any prior programming experience, but the majority of the people who get in from grades alone and haven't programmed in C or C++ end up finding that programming isn't all they thought it would be. As long as you keep doing well in math, and especially if you do well in physics (try and take the AP exams for both calc and physics if you can -- any level), then you'd have no problems getting in. They don't accept high school C++ credits and they don't look at the C++ AP exam (and rightfully so as the high level test was unbelievably simple and didn't even go into inheritance or templating or anything). Anyways, none of that matters now because next year the college board switches the CS AP course to Java (sadly).

If anything they should have ADDED Java as a separate CS course and not replaced C++ with it.

Anyway, talk to me in PM if you want to know anything else.

I know this thread is old, but we had the big BSP talk on this thread so I must breathe new life into it.

Anyway Poly, in your BSP you don't split the polygons, that means that the resulting bsp tree is smaller right? Does that also mean the tree would be faster to traverse through? (less nodes/leafs in the list, therefore less jumps to get from one place to another).

Whether or not the person chooses to make their implementation go all the way down into convex sets is another story, but it's highly beneficial if you do

EDIT:
If you are going to be drawing until a certain condition is met (in this case until the sectors formed are convex) then you must be using recursion. Isn't recursion slower than just running it x amount of times? It seems more appropriate to use recursion in this case, but I thought i've heard somewhere that recursion slows things down.