Just did I thought... what do you want to know? Okay. You have a list of points:

Code:

29.45, 89.43
32.47, 90.98
27.25, 95.63
27.29, 98.27
36.74, 96.32
31.90, 87.67
29.45, 89.43

Convert it to a list of lines, where line A is [ point 1 ] , [ point 2] and line B is [ point 2 ], [ point 3 ] and the last is [ point n ], [ point 1 ]

Code:

[ 29.45, 89.43 ], [ 32.47, 90.98 ]
[ 32.47, 90.98 ], [ 27.25, 95.63 ]
[ 27.25, 95.63 ], [ 27.29, 98.27 ]
[ 27.29, 98.27 ], [ 36.74, 96.32 ]
[ 36.74, 96.32 ], [ 31.90, 87.67 ]
[ 31.90, 87.67 ], [ 29.45, 89.43 ]
[ 29.45, 89.43 ], [ 29.45, 89.43 ]

I don't know of an off-the-shelf solution offhand, and you can google as well as I can, so I figured you wanted to know how to build one. There's some interesting looking perl modules that may help you, particularly this one's polygon_contains_point function.

---------- Post updated at 10:41 AM ---------- Previous update was at 09:53 AM ----------

Code:

#!/usr/bin/perl

use Math::Polygon::Calc;

my @poly = (    [       0,      0       ],
                [       10,     0       ],
                [       10,     10      ],
                [       0,      0       ]       );

if(polygon_contains_point([9, 1], @poly))
{
        print "Point is inside\n";
}
else
{
        print "Point is not inside\n";
}

exit 0;

you'll of course need to install the Math::Polycon::Calc CPAN module. You can do that by running the interactive 'cpan' program as root. Once it's done configuring itself, tell it 'install Math::Polygon::Calc' and it'll do so. Then 'quit' and it'll do so.