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

How collision detection relates to Quadtrees

1 post in this topic

I have been researching quadtrees for quite some time now and I have some questions concerning quadtrees and how they relate to collision detection.

 

Does each individual sub-node check for collision detection within its own cell? Or does each sub-node check for collision with its neighboring cell?

 

What are the depth levels when concerning Quadtrees?

 

Thanks in advance.

-1

Share this post


Link to post
Share on other sites

The quadtree itself doesnt do anything, its used as an aid to broad-phase collision detection to query the world to find sets of possibly colliding objects. The objects are usually represented by simplified geometry such as spheres or bounding boxes.

I would implement this by doing a breadth first kind of search down the quadtree to find pairs of potentially colliding objects (if two objects are in the same node, they are potentially colliding, even if one is in a subnode and the other in a higher level node)

 

You can either place the objects in the deepest cell in which they fit entirely, but that causes some objects that are located on the border of the high level cells to not really fit anywhere, possibly rising all the way to the root, such that the quadtree is only partially effective.

 

One solution to this is 'loose quadtrees' where the rectangles representing the nodes overlap (the node sizes have been essentially doubled along each axis). This means you can place the objects using their center position, and there will always be a node to place it in at a depth corresponding to the size of the object being placed. Naturally this means you also have to check adjacent quadtree nodes when finding sets of potentially colliding objects now that the nodes overlap with each other.

 

Im not exactly sure what you mean by depth, but if you mean the amount of levels in the quadtree or what levels the objects are placed in, that is probably very dependent on the situation. Its possible to make a quadtree that can create new levels as required to grow practically infinitely. If all your objects are of the same size, you can place them all to the leaf nodes of the quadtree (in this case a hashmap or something might work better, might not). If you have multiple sizes, you can use all depths.

You basically optimize it to the situation.

 

You should also consider the difference between 'dense' (???) and sparse quadtrees. Eg. Do you allocate nodes from somewhere as they are needed, or do you implement it using some multidimensional grids.

2

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