• 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
sobeit

how to do ray picking in shaders

8 posts in this topic

Hi there, 

 

recently I was trying to implement ray cast picking using geometry shader. I want to take mouse position of screen as parameter and return the intersection point of the picking and the triangle in world space or even better in object space.

 

I kinda know the basic idea, but I've got some confusions.

1. I can do line-triangle intersection in geometry shader, but I want to find a way to tell geometry shader, once after intersection test succeeds, to stop doing intersection test for rest of triangles. I don't how know to do that.

2. what if there are several objects along the way of picking ray, how do I determine the nearest one. even if there is only one object, how do I determine whether the triangle face intersecting with the ray is the back or front of the object?

3. I think I have to use transform feedback to retrieve the intersecting point, do I?

 

I really appreciate if someone could help out on this. Thanks.

Edited by sobeit
0

Share this post


Link to post
Share on other sites

1. Don't do that, you may miss closer intersection points on the same mesh. 

2a. Sort the pick results based on depth.

2b. dot product the pick ray with the face normal. If +ve, it's a back face, if -ve it's a front face.
3. probably the best method available.

0

Share this post


Link to post
Share on other sites

1. Don't do that, you may miss closer intersection points on the same mesh. 

Thank you very much. Is there any variable in shaders that it's value can persist through out one whole shading stage? like say I define a variable int counter = 0 in geometry shader, and I add a line counter++;. every time geometry shader executes, counter will increase by one.

 


2a. Sort the pick results based on depth.
2b. dot product the pick ray with the face normal. If +ve, it's a back face, if -ve it's a front face.

How do I record depth result in geometry shader?

Edited by sobeit
0

Share this post


Link to post
Share on other sites

i think you should read depth data from depth buffer, instead of making rays

but I need to use ray to do intersection with triangles.

0

Share this post


Link to post
Share on other sites

 i think you should read depth data from depth buffer, instead of making rays

 

Chicken and egg. Geometry has not yet been rasterised at that point in the pipeline.

 

 


1. Don't do that, you may miss closer intersection points on the same mesh. 

Thank you very much. Is there any variable in shaders that it's value can persist through out one whole shading stage? like say I define a variable int counter = 0 in geometry shader, and I add a line counter++;. every time geometry shader executes, counter will increase by one.

 

Why would you want to do that?

 

 


2a. Sort the pick results based on depth.
2b. dot product the pick ray with the face normal. If +ve, it's a back face, if -ve it's a front face.

How do I record depth result in geometry shader?

 

 

dot product the pick ray with the intersection point, store in the output point you generate.

Edited by RobTheBloke
0

Share this post


Link to post
Share on other sites


 
sobeit, on 22 Jun 2013 - 11:18 PM, said:
 
RobTheBloke, on 22 Jun 2013 - 6:21 PM, said:

1. Don't do that, you may miss closer intersection points on the same mesh. 
Thank you very much. Is there any variable in shaders that it's value can persist through out one whole shading stage? like say I define a variable int counter = 0 in geometry shader, and I add a line counter++;. every time geometry shader executes, counter will increase by one.
 
Why would you want to do that?

 

I want to create bool variable to store the test result of ray-triangle intersection. If intersection succeeds and dotProduct(ray, normalOfTriangle) < 0, then I can skip intersection test for rest of triangles. thanks

Edited by sobeit
0

Share this post


Link to post
Share on other sites

I want to create bool variable to store the test result of ray-triangle intersection. If intersection succeeds and dotProduct(ray, normalOfTriangle) < 0, then I can skip intersection test for rest of triangles. thanks

 

What you want, and what GPU's are capable of, are two different things. GPU's do not process the triangles serially, they process them in parallel. i.e. On a GTX titan, 1 triangle test takes the same amount of time as 3000 triangle tests. If you want to turn that into a serial process (and pass the bool from one triangle to the next), you'll be making the tests 3000x slower. So yes, you could ruin the performance of your selection routine, but I'd suggest just testing the triangles in a parallel fashion. It will be quicker.

 

1. Run a first pass using a ray/OBB test for the mesh. If a mesh passes that test.....

2. Test *every* triangle in the mesh.

3. Sort resulting intersections by depth.

It is impossible to early-out a ray/triangle test, without generating a bunch of incorrect intersections as a result (you might stop testing when you hit a triangle 19 meters away, however if you keep testing, you might hit a triangle only 9 meters away).

0

Share this post


Link to post
Share on other sites

What you want, and what GPU's are capable of, are two different things. GPU's do not process the triangles serially, they process them in parallel. i.e. On a GTX titan, 1 triangle test takes the same amount of time as 3000 triangle tests. If you want to turn that into a serial process (and pass the bool from one triangle to the next), you'll be making the tests 3000x slower. So yes, you could ruin the performance of your selection routine, but I'd suggest just testing the triangles in a parallel fashion. It will be quicker.

 

1. Run a first pass using a ray/OBB test for the mesh. If a mesh passes that test.....

2. Test *every* triangle in the mesh.

3. Sort resulting intersections by depth.

It is impossible to early-out a ray/triangle test, without generating a bunch of incorrect intersections as a result (you might stop testing when you hit a triangle 19 meters away, however if you keep testing, you might hit a triangle only 9 meters away).

 

Thank you so much, this totally clear my confusion.

Edited by sobeit
0

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