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

How to get the number of solid tiles between two points?

10 posts in this topic

The title says it all. How do i get the number of solid tiles between two points (or two tiles)? Ive been trying to think as to how to implement this algorithm, but all attempts so far have failed.

Here is a image showing what I want to do...

[url="http://www.xanather.com/lighting.png"]www.xanather.com/lighting.png[/url]

(the red tiles and the line are drawn in through paint, not part of the rendering).

The reason I want to implement this is to allow for dynamic 2D lighting between all tiles. A wall of tiles will block some lighting (it similar to Terraria's lighting).

After I implement this I will be able to obtain how many solid tiles are between two points and reduce the lighting depending on the amount of solid tiles that are in between these two points.

Anyway, I hope someone can help me :D

All replies are appreciated. Thanks,
Xanather.
0

Share this post


Link to post
Share on other sites
EDIT: Sorry, just realized my below algorithm is incorrect, ignore it for now.

Loop start from one point, move in dx=TileWidth-1, dy=TileHeight-1 toward to the end point, until reach or beyond the end point.
In each move, get the tile at that point, check if it's a solid tile.
This will be sure you loop all tiles covered by the line and won't miss any tile. Edited by wqking
2

Share this post


Link to post
Share on other sites
The number of tiles is the maximum of the distance in the X or Y direction. If you have two points (x1,y1) and (x2,y2), then the number of tiles is max(abs(x2-x1), abs(y2-y1)).

There are a few variants to how to treat the values you have to be aware of though. Depending on if you want to, say, count both the start and end tiles, or only count the start or end tile but not he other, or if you want the number of tiles bwteen the two points, and how you want to handle fractional coordinates, you may have to round the values differently and at different places and add or subtract one at some places.

Combinations includes round(), floor(), ceil() of either the individual coordinates, the difference between them, of absolute values or of the maximum value. Edited by Brother Bob
2

Share this post


Link to post
Share on other sites
[quote name='Brother Bob' timestamp='1348401415' post='4982889']
the number of tiles is max(abs(x2-x1), abs(y2-y1)).
[/quote]

How does that work? Wont that just get the number of tiles in one of the two directions? (only the change in X or only the change in Y)?

Xanather.
0

Share this post


Link to post
Share on other sites
You can try to use [url="http://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm"]Bresenham's line algorithm[/url]. Go from the source to the destination you can then count the number of solid tiles along the way.
1

Share this post


Link to post
Share on other sites
[quote name='Xanather' timestamp='1348405913' post='4982906']
[quote name='Brother Bob' timestamp='1348401415' post='4982889']
the number of tiles is max(abs(x2-x1), abs(y2-y1)).
[/quote]

How does that work? Wont that just get the number of tiles in one of the two directions? (only the change in X or only the change in Y)?

Xanather.
[/quote]
Look at the picture you posted and count the pixels, and think of how moving one of the points one or two steps to the left or right affects the outcome. There are 10 red squares, and there are 10 pixels difference in the Y-direction. Moving, say, the top point one or two points to the left or to the right will just change how the 10 points are distrubuted along the X-axis. It's only when the end point is 11 pixels or more away from the start point in the X-direction that you have to add more points in the X-direction, but then the X-direction has become dominant and that is taken care of by the max() function.

Bresenham's algorithm as TrickyLogic linked to is a perfect example demonstrating this. Bresenham's works by looping over each discrete step in [i]either the X or the Y[/i] direction, and calculates the other direction by error accumulation. It generates exactly as many pixels as the greatest distance along the either X or the Y direction. Edited by Brother Bob
1

Share this post


Link to post
Share on other sites
The picture actually looks like it's using Bresenham's algorithm. Notice how it favors one axis (Y) over the other (X)? Even though the actual line covers some tiles by almost half, they aren't in red, while others are barely covered and are in red. It's iterating over Y with error accumulation in X.u

Basically forget the pixel level of it all. Your creating a line between two tiles. Using Bresenhams algorithm over the tiles is the same as using it over pixels.

Now, as others have said, if your really just wanting 'the number of solid tiles between two points' and your counting the tiles in red in the photo, then it is just the greater of the absolute of the difference in Y or X. (As defined by the outer loop in the algorithm.)
1

Share this post


Link to post
Share on other sites
[quote name='Scienthsine' timestamp='1348420467' post='4982969']
Now, as others have said, if your really just wanting 'the number of solid tiles between two points' and your counting the tiles in red in the photo, then it is just the greater of the absolute of the difference in Y or X. (As defined by the outer loop in the algorithm.)
[/quote]

This algorithm wouldn't account for any missing tiles. Although it would speed it up greatly. Perhaps a switch can be implemented for people using slower computers.
1

Share this post


Link to post
Share on other sites
Ok well, I managed to implement Bresenham's line algorithm. Its creating some nice effects too...

[url="http://www.xanather.com/hmm.png"]http://www.xanather.com/hmm.png[/url]

And here is the code:

[source lang="csharp"] static byte GetTileReduction(int x0, int y0, int x1, int y1)
{
int reduction = 0;
if (x0 > x1)
{
int temp1 = x1;
int temp2 = y1;
x1 = x0;
y1 = y0;
x0 = temp1;
y0 = temp2;
}
int deltax = x1 - x0;
if (deltax == 0)
{
deltax = 1;
}
int deltay = y1 - y0;
float error = 0;
float deltaerror = (deltay / deltax);
int y = y0;
for (int x = x0; x < x1; x++)
{
if (Engine.tiles[x, y].type != 0)
{
reduction += 20;
if (reduction > 255)
{
reduction = 255;
}
}
error += deltaerror;
if (error >= 0.5f)
{
y = y + 1;
error = error - 1f;
}
}
return (byte)reduction;
}[/source]

The problem is that this occurs when the light source is completely underground...

[url="http://www.xanather.com/hmm2.png"]http://www.xanather.com/hmm2.png[/url]

I am lost, it seems as when the "imaginary" line in the algorithm gets steeper the solid tiles found reduce, resulting in the brighter-than-it-should-be colored tile (brighter) along the vertical parts of the lighting... It should be just a smaller sphere (circle).

I hope you understand what I mean, Ive been trying to tackle this for a while now.

I feel like the actual problem is right under my nose xD

Xanather.

EDIT:

The
[source lang="csharp"]if (deltax == 0)
{
deltax = 1;
}[/source]
is temporary obviously... Edited by Xanather
0

Share this post


Link to post
Share on other sites
OK, I solved it. I instead implemented the optimization algorithm found here:

[url="http://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm"]http://en.wikipedia...._line_algorithm[/url]

I realized that I wasn't following the rules of the first basic algorithm. The second algorithm on that site takes care of that.

The lighting looks awesome now!

I have no idea how it works, but I will be sure to make sense of it later on...

Thanks everyone : D Edited by Xanather
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