Difference between revisions of "Polygon Area"

Revision as of 15:58, 13 February 2011

To calculate the area of a non-self-intersecting polygon:

see Polygon Area at :

Weisstein, Eric W. "Polygon Area." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/PolygonArea.html

If the polygon is a lattice polygon, then area can be calculated from the number of interior lattice points by Picks theorem:

A = I + B/2 - 1, where I = # of interior lattice points, B = # of border points

SInce all the outlines in MindsEye are on a pixelated grid, this may be the fastest way to calculate the area.

Weisstein, Eric W. "Lattice Polygon." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/LatticePolygon.html

see also Randall Crandall Projects in Scientific Computation ISBN-10: 0387950095 (but I forget why this book is relevant)

@@ Line 5: / Line 5: @@
 If the polygon is a lattice polygon,  then area can be calculated from the number of interior lattice points by Picks theorem:
- :''A = I + B/2 - 1, where I = # of interior lattice points, B = # of border points''
+:''A = I + B/2 - 1, where I = # of interior lattice points, B = # of border points''
 SInce all the outlines in MindsEye are on a pixelated grid, this may be the fastest way to calculate the area.