areas and volumes for regular and irregular polygons

Does anyone have any Pipeline Pilot protocols for computing the area and volumes for regular and irregular polygons?

The input would be a set of either 2D or 3D coordinates.  It would be important that the algorithm check to see if a point is

inside the polygon or a vertex.  If inside, then the point will likely be discarded.

Thank you.

Regards,

Jim Metz

Abbott Laboratories

(847) 936 - 0441

James.Metz@Abbott.com