Oct 4, 2013
Crysis 3 v1.1 All No-DVD [Reloaded].
Crysis 3 v1.1 – Crytek (Rev.1.0) – No DVD, no CD, fix script error
Oct 6, 2013
Crysis 3 v1.2 All No-DVD [Reloaded].
Crysis 3 v1.2 – Crytek (Rev.1.0) – No DVD, no CD, fix script error
Jul 11, 2015
Crysis 3 v1.3 All No-DVD [Reloaded].
Crysis 3 v1.3 – Crytek (Rev.1.0) – No DVD, no CD, fix script error
Oct 17, 2013
Crysis 3 v1.0 All No-DVD [Reloaded].
Crysis 3 – Crytek (Rev.1.0) – No DVD, no CD, fix script error
CRYTECH’s NEXT GENERATION SELF RUNNERS – Crysis 3
Jan 9, 2012

References

Category:Video game mods
Category:First-person shooters
Category:Demolition
Category:CryEngine
Category:Id TechQ:

LINQ query to find the largest square under a polygon

I want to determine the largest square under a polygon in memory.

The polygon must intersect the ground.
The polygon must not contain itself.

So if I have a polygon (x1,y1) (x2,y2) (x3,y3)… (xn,yn)
I want to calculate the X-value of the largest square under the polygon and the Y value of the largest square under the polygon.
The method must not be “advanced” by using two polygons but working with one polygon and iterate through each vertex. (where d is the polygon edge and p.X and p.Y is the pth vertex)
I’ve tried a recursive solution with upper- and left-recursion but I don’t think this is the way to go, so I’ve begun implementing an ad-hoc solution using a stack which isn’t great but it works (I am now using a Stack and a HashSet to track the largest squares and store the leaf values).
Is there a better way?

A:

Mar 22, 2012