• 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.
Sign in to follow this  
Followers 0

Ray/Triangle Intersection Difficulties

2 posts in this topic

I realize this topic is covered extensively, but I've looked at dozens of academic presentations and I can't seem to make any of them work.

I am attempting to detect [b]a)[/b] whether a ray (poiint/direction) intersects with a given triangle and [b]b)[/b] where (in world coordinates). I adapted the following code from the lighthouse 3D article:

[source lang="cpp"]int isx3d(Line3D line, Plane3D plane, Number3D *where) {
Number3D e1 = vec3d(plane.v0, plane.v1);
Number3D e2 = vec3d(plane.v0, plane.v2);
Number3D h = cross3d(line.p1, e2);
float a = dot3d(e1, h);
if (a > -0.00001 && a < 0.00001) //(close_enough(a, 0.0f))
return FALSE;
float f = 1.0f/a;
Number3D s = vec3d(plane.v0, line.p0);
float u = f*dot3d(s,h);
if (u < 0.0f || u > 1.0f)
return FALSE;
Number3D q = cross3d(s, e1);
float v = f*dot3d(line.p1,q);
if (v < 0.0f || u+v > 1.0f)
return FALSE;
float t = f*dot3d(e2, q);
if (t > 0.00001) {
float w = 1.0f-(u+v);
Number3D ww;
ww.x = w*plane.v0.x+u*plane.v1.x+v*plane.v2.x;
ww.y = w*plane.v0.y+u*plane.v1.y+v*plane.v2.y;
ww.z = w*plane.v0.z+u*plane.v1.z+v*plane.v2.z;
*where = ww;
return TRUE;
return FALSE;

This code seems very similar to other examples, but it has a couple of problems:

First, it works when the point of origin is on the negative side of the triangle, but when the point of origin is on the positive side, it can trigger a false positive result (as if it is considering the ray being cast negatively from the point of origin as well).

Second, the resulting point is wrong. I have tried transforming this every way I can think of, but it either walks across the face of the triangle in a diagonal line (instead of horizontally if I just moving the point of of origin on the X/Y plane) or it moves along a curve(?). Edited by kmx

Share this post

Link to post
Share on other sites
Yeah, ray-triangle intersection is a real pain to get up and running. I'll give you one version that works - it may not be the fastest available but it'll get you back on track until you find better:
/* Let P1, P2, P3 be the three vertices of the triangle, in world space.
Let E1 be the vector P2 - P1, and E2 be the vector P3 - P1 (i.e. the triangle's edge vectors).
Let R be the ray to intersect, where R.Origin is the ray's origin and R.Direction is the ray's normalized direction. */

/* Then you calculate the following quantities: */

s1 = cross(R.Direction, E2);
d = 1 / dot(s1, E1);

/* You then calculate the first barycentric coordinate of the intersection point, u: */

dist = R.Origin - P1;
u = dot(dist, s1) * d;

/* If u is not in [0..1] (account for floating-point inaccuracies here), there is no intersection. */

/* We now calculate the second barycentric coordinate, v, using a quantity s2: */

s2 = cross(dist, E1);
v = dot(R.Direction, s2) * d;

/* If v is less than zero, or u + v is more than 1, there is no intersection. */

/* Otherwise, the intersection distance along the ray is given by: */

Distance = dot(E2, s2) * d;

This will give you the intersection distance along the ray (so R.Origin + R.Direction * Distance will give you the intersection point in world coordinates), and will inform you if the ray does not intersect the triangle (if you are only looking to know whether the ray intersects the triangle, without needing the intersection point, there might be faster ways of doing it!).

This method definitely works as I've used it in my ray tracer, however you need to be careful that all your inputs are in world coordinates, otherwise it obviously won't work. If you need more info/help don't hesitate!

Share this post

Link to post
Share on other sites
Thanks - finally figured out what was going on - my edge vectors were normalized when they should not have been.

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  
Followers 0