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

Line Intersection in Tiled Map

6 posts in this topic

Hello guys! my game is going really well and everything is almost complete, but i've just realized that i need a way to determine if a path between two points ( a line ) is obstructed. The problem is that i have no idea how to implement it! As the title says i'm using a tiled map, but everything else is not tile-based.

The basic idea would be to do a bruteforce check for every tile, but it's too slow, and for the line check i should check every 4 side of every tile. I could use a quadtree ( already using it for all the others collisions ), but have no idea how to make it work with a line.

Another clue i have, but not sure how to implement it or make it work, is to check for which tiles this line passes ( as if they were single pixels ) and then check if those are walls or not.

Hope you guys can help me or simply give me a hint!
0

Share this post


Link to post
Share on other sites
A partial answer to this part: "Another clue i have, but not sure how to implement it or make it work, is to check for which tiles this line passes ( as if they were single pixels ) and then check if those are walls or not."

The algorithm you're looking for is "grid traversal", there's tons of stuff if you just google for that. (e.g. the first hit [url="http://www.gamerendering.com/2009/07/20/grid-traversal/"]http://www.gamerendering.com/2009/07/20/grid-traversal/[/url] looks OK, but it's Java)
0

Share this post


Link to post
Share on other sites
If your map is static, you could precompute a signed distance field for it. A signed distance field is basically a map, where each pixel tells you, how far away the nearest edge is. This way, you don't need to check every pixel. If the ray you're tracing is on a pixel where the nearest edge is 10 pixels away, you can skip checking the next 9 pixels and just check the pixel which is 10 pixels away. You do this process over and over again, until you find a collision.
Pixels which are inside your objects have a negative distance. So you basically found your collision, if the distance is less than zero.

[CODE]
Point Ray::trace()
{
do
{
distance = signedDistanceField.getDistance(getPosition());
march(distance);
} while (distance > 0);
return getPosition();
}
[/CODE] Edited by CryZe
0

Share this post


Link to post
Share on other sites
Well, he could modify the algorithm to only accept a negative distance as a collision, if the ray actually hits a solid side of the tile. Otherwise he simply traverses the ray forward. Since he doesn't have a usable distance at this point, he would need to move the ray just a single pixel forward. Edited by CryZe
0

Share this post


Link to post
Share on other sites
[quote name='C0lumbo' timestamp='1353402168' post='5002618']
A partial answer to this part: "Another clue i have, but not sure how to implement it or make it work, is to check for which tiles this line passes ( as if they were single pixels ) and then check if those are walls or not."

The algorithm you're looking for is "grid traversal", there's tons of stuff if you just google for that. (e.g. the first hit [url="http://www.gamerendering.com/2009/07/20/grid-traversal/"]http://www.gamerendering.com/2009/07/20/grid-traversal/[/url] looks OK, but it's Java)
[/quote]

That is exactly what i was looking for. The normal line-drawing algorithm is not enough :)
Thanks for the other replies too!
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