Sunday, April 02, 2006

Plotting Headaches

Lets say I have a grid G.
The grids cells are composed of one of two types - free or occupied.

Now given a point in the grid P, what's the biggest rectangle we can make that includes P?

That's the algorithm I'm currently writing. I wrote some on Friday, I think, but it was godawful and very complicated. The one I'm writing now is much cleaner and should work nicely.

2 comments:

Fernando said...

Hey there, Dan. I'm a newbie programmer from Dominican Republic and got severely hooked on your C# Game Dev tutorial/blog/howeveryouwannacallit. =p So I was wondering, is there any way I can grab all your posted entries from the very start of the blog (as in, could you send them to me, or is there any way I can get them in a nice, compressed package), or am I forced to spider your site to get everything? I'm highly interested in your stuff, since after I finish university here, I plan to get into the game dev business with several friends and classmates, starting by giving some exposition to the local gaming scene, then the game developers and all those who want to get involved in game creation; and your research would be really, really helpful to all of us.

Thanks in advance, and keep up the great work. Bookmark'd and Dugg'd! =D

http://digg.com/programming/C_Game_Developing_Tutorials_and_Rants

Dan said...

I wouldn't mind a copy myself really :D

I think there's some way to do it in blogger by editing the template. I'll give it a go this weekend and if I'm succesful I'll send you the results.