Computational Geometry

From Algorithmist
Revision as of 11:39, 25 November 2009 by Larry (Talk | contribs) (Tidied up.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
This is a stub or unfinished. Contribute by editing me.

There is a simple formula for the area of any polygon whose edges do not cross (a "simple" polygon), see Wikipedia:Polygon#Area. You can also determine if the polygon is clockwise or counterclockwise.

There is also a very simple area formula that works on 2D rectangular grids: Wikipedia:Pick's_theorem