Difference between revisions of "Line of sight"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
One of the more popular (simple) methods of determining whether something in the game world is visible (or targetable) is to input the x,y coords for the target and the player and then walk along a line between them. At each step on the line, the game checks to see if anything is in the world at these coords that would prevent a player's sight (like a wall). | One of the more popular (simple) methods of determining whether something in the game world is [[visible|visibility]] (or targetable) is to input the x,y coords for the target and the player and then walk along a line between them. At each step on the line, the game checks to see if anything is in the world at these coords that would prevent a player's sight (like a wall). | ||
One way to do it is by using the [[Breshenham's Line Algorithm]]. | One way to do it is by using the [[Breshenham's Line Algorithm]]. | ||
[[Category:Algorithms]] | |||
Revision as of 19:41, 18 September 2005
One of the more popular (simple) methods of determining whether something in the game world is visibility (or targetable) is to input the x,y coords for the target and the player and then walk along a line between them. At each step on the line, the game checks to see if anything is in the world at these coords that would prevent a player's sight (like a wall).
One way to do it is by using the Breshenham's Line Algorithm.