Difference between revisions of "Talk:Permissive Field of View"

From RogueBasin
Jump to navigation Jump to search
(advertising my new algo)
 
m
Line 1: Line 1:
Hi! I have a different algorithm, a mix of Recursive Shadow Casting and Precise Permissive Field of View. Seems simpler and does not inspect tiles behind obstacles, so should be much simpler on maps with long corridors. It's coded in Haskell. Please have a look and point flaws in it at https://github.com/Mikolaj/LambdaHack/wiki/Fov-and-los. Also, it's version modified for DFOV is even simpler and faster, so perhaps we could have DFOV in libtcod again? --[[User:Mikon|Mikon]] 02:26, 15 December 2010 (UTC)
Hi! I have a different algorithm, a mix of Recursive Shadow Casting and Precise Permissive Field of View. Seems simpler and does not inspect tiles behind obstacles, so should be much faster on maps with long corridors. It's coded in Haskell. Please have a look and point flaws in it at https://github.com/Mikolaj/LambdaHack/wiki/Fov-and-los. Also, its version modified for DFOV is even simpler and faster, so perhaps we could have DFOV in libtcod again? --[[User:Mikon|Mikon]] 02:26, 15 December 2010 (UTC)

Revision as of 02:27, 15 December 2010

Hi! I have a different algorithm, a mix of Recursive Shadow Casting and Precise Permissive Field of View. Seems simpler and does not inspect tiles behind obstacles, so should be much faster on maps with long corridors. It's coded in Haskell. Please have a look and point flaws in it at https://github.com/Mikolaj/LambdaHack/wiki/Fov-and-los. Also, its version modified for DFOV is even simpler and faster, so perhaps we could have DFOV in libtcod again? --Mikon 02:26, 15 December 2010 (UTC)