On Tue, Dec 8, 2020 at 11:30 PM Roger L Costello costello@xxxxxxxxx <
xsl-list-service@xxxxxxxxxxxxxxxxxxxxxx> wrote:

> The Point-in-a-Polygon problem is this:
>
> Given:  v = a lat/long value
>         p = a series of (lat,long) pairs representing a polygon
>
> Determine if v is within p.
>
> Question: Do you have XSLT code which solves the Point-in-a-Polygon
> problem?
>

There are couple of algorithms written in C, described here
http://www.eecs.umich.edu/courses/eecs380/HANDOUTS/PROJ2/InsidePoly.html. I
guess, one should be able to adapt these to XSLT.




-- 
Regards,
Mukul Gandhi