Jump to content

  • Log In with Google      Sign In   
  • Create Account

We're offering banner ads on our site from just $5!

1. Details HERE. 2. GDNet+ Subscriptions HERE. 3. Ad upload HERE.


Don't forget to read Tuesday's email newsletter for your chance to win a free copy of Construct 2!


greggles

Member Since 28 Sep 2007
Offline Last Active Nov 23 2013 01:54 AM

Topics I've Started

Seattle Area

28 April 2012 - 11:23 AM

After much work, college is finally coming to a close: in just a few weeks I will be graduating! I am looking forward to starting a job in the Seattle, WA area this July, and I, as someone who grew up on the East coast and doesn't know much about Seattle, was wondering if anyone from the area would be willing to share their wisdom. I would like to get suggestions on things like: good areas to live, fun hangouts, interesting places to visit, gamedev groups, game jams, etc.

Concave polyhedra intersection tests

28 May 2008 - 04:04 AM

I've been looking for examples on how to test the intersection between two concave polyhedra, but can't seem to find any. So, here's what I was thinking of doing: 1. Find if any of the triangles in polyhedron #1 intersect any of the triangles in polyhedron #2. If any do, then the polyhedra intersect. If not, move to 2. 2. Find if all of the vertices of polyhedron #2 are inside of polyhedron #1. If so, then the polyhedra intersect. If not, move to 3. 3. Find if all of the vertices of polyhedron #1 are inside of polyhedron #2. If so, then the polyhedra intersect. If not, then the polyhedra do not intersect. Is this the correct way to do it? If so, then I need help with 2 and 3: I tried to extend 2d point in polygon tests (send a ray outward to infinite x and count how many times it intersects a line) into 3d, but I could not think of how I would handle the ray hitting vertices. There could be an infinite number of triangles attached to a vertex in 3D, but in 2D there will always be 2 lines attached to a vertex. Is there a know way to handle that? The only other way that I can imagine to find if a point is in a concave polyhedra would be to find the closest triangle to the point and see if the normal points toward or away from the point. Is there some thing else that I am missing? Am I heading in the right direction? Greggles

ZCam?

27 February 2008 - 03:40 PM

I just watched a video on IGN that showed a camera (ZCam) which takes videos with depth -- used to create a boxing game in the same vein of WiiSports Boxing. I thought I would share with the rest of GDNet (or at least those who haven't already seen it). Do you think this will be cheap enough to be used in games in the future? If you were to create a game that uses it, what would your game do with it? I was thinking that many DS and Wii games could easily be done with it-- probably making the games better. Also, does anyone who was at GDC have any more information on it, such as when it is going to be sold to the public?

What have been your worst computer problems?

22 October 2007 - 02:50 PM

I just had a terrible week last week trying to fix all of my computer problems, so I was thinking that it would be interesting to hear from the rest of GameDev.net -- what has been the worst week that you have had dealing with computer problems? Personally, last week was mine. First of all, my hard drive died. Not some slow death so that I had time to back everything up. No, it went up in a puff of smoke, which must have been a result of a power surge or something. "Okay," I thought, "this isn't too bad, I have another hard drive, maybe I can use it." But, as I was trying to install Windows XP, I found out that I lost the key to install it! "Hmm, so I'll just have to use a different computer". But, after all of this had happened, the internet in my house suddenly decided to stop working, and it took me about two hours to fix the router and get everthing up and running again. Greggles

PARTNERS