• 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

Does the projection of a point onto a plane belong to a triangle in that plane? (3D)

3 posts in this topic


In 3D, say you have a triangle defined by three non-aligned points (A,B,C).

How do I find out if the projection of a fourth point onto the plane that the triangle belongs to is inside the triangle? Edited by Werner291

Share this post

Link to post
Share on other sites
The obvious solution is: Compute the projection of the point onto the plane, then check if it's inside the triangle (easiest way to do that part is probably to express the point on the plane in a reference that has a vertex as origin and two sides as vector basis).

A less obvious solution: Compute the planes defined by the sides of the triangle and a perpendicular to the plane, check if the point is on the "inside" of each of the planes.

I don't think there are big differences to prefer one over the other, but I would go for the less obvious solution because it feels more robust.

Share this post

Link to post
Share on other sites
I took your second solution, it works excellently!

Here's the resulting code:
[source lang="cpp"]Ogre::Vector3 vectorOA = wallStrip[itr-2];
Ogre::Vector3 vectorOB = wallStrip[itr-1];
Ogre::Vector3 vectorOC = wallStrip[itr];

Ogre::Vector3 vectorAB(vectorOB - vectorOA);
Ogre::Vector3 vectorBC(vectorOC - vectorOB);
Ogre::Vector3 vectorCA(vectorOA - vectorOC);

Ogre::Vector3 faceNormal = vectorAB.crossProduct(vectorCA) * (itr%2==0 ? 1.0 : -1.0); // It's a triangle strip
if (vectorOA.dotProduct(faceNormal) > 0){
Ogre::Vector3 ABNormal = vectorAB.crossProduct(faceNormal);
if (vectorOA.dotProduct(ABNormal) > 0) continue;

Ogre::Vector3 BCNormal = vectorBC.crossProduct(faceNormal);
if (vectorOB.dotProduct(BCNormal) > 0) continue;

Ogre::Vector3 CANormal = vectorCA.crossProduct(faceNormal);
if (vectorOA.dotProduct(CANormal) > 0) continue;

// The projection falls within the triangle

It also checks wether the point is on a specific side of the triangle, it's also inside a loop iterating through a vector of these triangles.
The point that I'm testing is actually the origin in this case, that's why you don't actually see it in the code.

It actually even worked the first time! (That was very unlikely, I'm a champion at typos [img]http://public.gamedev.net//public/style_emoticons/default/tongue.png[/img]) Edited by Werner291

Share this post

Link to post
Share on other sites
The projection approach isn't all that bad, all you need is the projection matrix:

P = (M[sup]T[/sup]M)[sup]-1[/sup]M[sup]T[/sup]

Like Alvaro said, use two sides of the triangle as the basis vectors, in this case we'll use (B-A) and (C-A), where 'A', 'B', and 'C' are the triangle points. Plug those vectors into the columns of matrix 'M', which makes it 3x2. Solve for the projection matrix 'P', which can be done by hand since the matrices are small, and then easily translated to code.

Now let's say you're testing point 'D'. All you do is multiply (D-A) by the previously calculated projection matrix 'P', which results in a 2D vector. This is the coordinate of the projected point in the subspace defined by the original basis vectors. Let's call the coordinate values 'x' and 'y'. It follows that that the projected point is in the triangle iff the sum (x+y) is less than or equal to 1, and both 'x' and 'y' are non-negative.

I know the explanation seems pretty intense, but once you've boiled down the math, it ends up being only a few lines of code :)

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