• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.


This topic is now archived and is closed to further replies.


Orientated bounding cube-> triangle collision checking

1 post in this topic

Hi, I am thinking my way to programming an orientated bounding cubewith scenery geomery (triangles)... My initial thinking lead me to think that triangle-edges -> box planes was the correct route to take...but what about if the bounding cube intersects the middle of the triangle? My thinking at present is to make the bounding cube 12 polys and do triangle->triangle checking... Can anyone tell me I am being stupid and the correct thinking to the sollution? Thanks in advance ** Ste ~Having read a lil more i c that 'Voorhies triangle-cube intersection' solves this problem by: 1. If any edge intersects the cube, return true. 2. If the polygon interior intersects the cube, return true. 3. Return false So, is accepted as faster than 12 triangle->triangle tests? Edited by - Jedaye on August 15, 2001 11:03:42 AM

Share this post

Link to post
Share on other sites
no one even implements face to face collition , lets count face to face , shell we :
( i might have some slight mistakes about the clock-ticks )
we will start with point to face and then multiply by 3 :
int classifypoint(point v,plane p){
float f=dotproduct(v,p.n)+p.d;
if(f>0) return 2;
if(f<0) return 1;
return 0;

first we have dotproduct(v,u)=v[0]*u[0]+v[1]*u[1]+v[2]*u[2];
i count 3 mults and 2 sums which equals 3*3+2*3=15ct
now the sum after the dotproduct is 3ct , so we have 18ct by now
lets ignore the "if" part in the function for the time being.

so 18ct per vertex ==> 54ct per polygon
==>648ct per box

I really dont think so !!!

try treating the box as a point and then you have to use plane shifting , and i have absolutly no idea about how to do that !!!

the rubber-hound

Share this post

Link to post
Share on other sites