Difference between revisions of "Talk:Basic BSP Dungeon generation"
Jump to navigation
Jump to search
(Code Snippets for BSP Generation?) |
m (Reverted edits by 46.33.241.195 (talk) to last revision by Languard) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
Is there any code snippits I can look through for this? It would be helpful to see what it looks like from a code standpoint instead of the theory presented on the main page. It looks simple enough, but I'm having trouble implementing it. --[[User:Loendal|Loendal]] 16:03, 13 February 2011 (UTC) | Is there any code snippits I can look through for this? It would be helpful to see what it looks like from a code standpoint instead of the theory presented on the main page. It looks simple enough, but I'm having trouble implementing it. --[[User:Loendal|Loendal]] 16:03, 13 February 2011 (UTC) | ||
I'm not done with mine as of this edit, but here is a link to my code: [http://WebRogue.languard.kodingen.com/code/bsp.js WebRogue:bsp.js] Does anyone have objections to me adding in few pointers? There are a few gotchas to this algorithm, such as getting degenerate splits if you say split vertically three times in a row.<br> | |||
[[User:Languard|Languard]] 00:48, 13 April 2011 (UTC) | |||
Latest revision as of 21:55, 29 August 2011
Is there any code snippits I can look through for this? It would be helpful to see what it looks like from a code standpoint instead of the theory presented on the main page. It looks simple enough, but I'm having trouble implementing it. --Loendal 16:03, 13 February 2011 (UTC)
I'm not done with mine as of this edit, but here is a link to my code: WebRogue:bsp.js Does anyone have objections to me adding in few pointers? There are a few gotchas to this algorithm, such as getting degenerate splits if you say split vertically three times in a row.
Languard 00:48, 13 April 2011 (UTC)