Thread: ray casting

  1. #61
    No, in an attempt to keep newer programmers from getting intimidated and dropping out, they only allow us to do ascii-based games first year
    Well I can understand that, it is very easy for newcomers to just get overwhelmed. What do you think my chances are of getting into the school you are going to? I mean I've been doing C++ for about a year now, so by the time I'm applying to colleges that's 3 years programming under my belt. I'm good at math (I will probably have 5 math courses by the time i'm done with high school). I'm okay at science, I don't have as much of an aptitude with that as with math, but I will have taken both chemistry and physics by the time I'm done with high school.

  2. #62
    Programming Sex-God Polymorphic OOP's Avatar
    Join Date
    Nov 2002
    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.

  3. #63
    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
    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.
    Last edited by Shadow12345; 01-09-2003 at 07:09 PM.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Need help designing a recursive function.
    By broli86 in forum C Programming
    Replies: 3
    Last Post: 07-24-2008, 12:45 PM
  2. Casting
    By morvick in forum C++ Programming
    Replies: 2
    Last Post: 06-17-2007, 11:06 PM
  3. Ray tracer and collision detection
    By hdragon in forum Game Programming
    Replies: 31
    Last Post: 01-19-2006, 11:09 AM
  4. question about casting pointers/other types also??
    By newbie02 in forum C++ Programming
    Replies: 3
    Last Post: 08-07-2003, 05:01 AM