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

An Efficient Parametric Algorithm for Octree Traversal - Question

5 posts in this topic

Hello!

I'm trying to implement an algorithm found here: wscg.zcu.cz/wscg2000/Papers_2000/X31.pdf
I think I uderstand the algorithm quite well, but the author does not metions (or atleast I dont se it) the case where a ray origin in lies inside the actual
octree. When the ray comes hits the octree from the outside it is quite easy to determine the first node and next nodes.
What if the ray origin lies in cell 4 (if we have a octree of deph 1), what is then the first cell (if we are using the mentioned algorithm)?
0

Share this post


Link to post
Share on other sites
Maybe the article neglects to repeat that the parameter [b]t[/b] has to be positive; but it has little practical importance beyond culling sectors 1, 2 and 3 (because they don't contain the ray's starting point [b]p [/b]and the direction vector points between up and right from somewhere in sector 4)
Sector 4, on the other hand, is guaranteed to contain an intersection because it contains [b]p[/b].
0

Share this post


Link to post
Share on other sites
[quote name='LorenzoGatti' timestamp='1329222925' post='4912947']
Maybe the article neglects to repeat that the parameter [b]t[/b] has to be positive; but it has little practical importance beyond culling sectors 1, 2 and 3 (because they don't contain the ray's starting point [b]p [/b]and the direction vector points between up and right from somewhere in sector 4)
Sector 4, on the other hand, is guaranteed to contain an intersection because it contains [b]p[/b].
[/quote]

Yes, I know that, but I need to use the algorithm for octree ray traversal and I don't see the solution with this algorithm when t is negative. Does the solution exists?
0

Share this post


Link to post
Share on other sites
Don't expect this sort of paper to spell out everything in detail; some parts of the whole algorithm, in this case very important ones like locating a point ([b]p[/b]) in a octree or discarding the sectors that intersect only the opposite ray ([b]t[/b]<0) are obvious (to the authors) and already in common practice (and therefore outside the scope of a non-tutorial paper).

With few commendable exceptions, the purpose of a research paper that claims to give an algorithm to do something is illustrating some novel idea (in this case trickery with parametric line/ray equations and sector edges), not describing and demonstrating a complete and dependable solution for the stated problem; a practical implementation that has a good performance and doesn't choke on boring corner cases (e.g. 45° angles or rays through the center of a sector) is your job.
0

Share this post


Link to post
Share on other sites
In algorithm (section 4), when any exit parameter is negative, the node is skipped (main recursive function returns). Thus the algorithm works correctly no matter whether ray origin is inside or outside the octree. It will skip nodes until the node containing the origin is visited. It is true research papers do not go into details, but this paper is a quite practical one, and going from paper to implementation is not complicated.
0

Share this post


Link to post
Share on other sites
[quote name='curena' timestamp='1329677474' post='4914579']
It is true research papers do not go into details, but this paper is a quite practical one, and going from paper to implementation is not complicated.
[/quote]
This is only because in this paper the combination of unusually detailed exposition and unusually simple math allows anybody to reconstruct the neglected details without leaving holes, but the authors actually skip I/O and special and symmetric cases like the best of them.
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