ISSN:
1573-8868
Keywords:
Spherical
;
polygon
;
locate
;
sort
;
algorithm
;
FORTRAN
;
subroutine
Source:
Springer Online Journal Archives 1860-2000
Topics:
Geosciences
,
Mathematics
Notes:
Abstract An algorithm for determining if any given point,P, on the surface of a sphere is located inside, outside, or along the border of an arbitrary spherical polygon,S, is described. The polygon is described by specifying coordinates of its vertices, and coordinates of some pointX which is known to lie withinS. The algorithm is based on the principle that an arc joiningX andP will cross the border ofS an odd number of times ifP lies outsideS, and an even number of times ifP lies withinS. The algorithm has been implemented as a set of FORTRAN subroutines, and a listing is provided. The algorithm and subroutine package can be used with spherical polygons containing holes, or with composited spherical polygons.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00894449
Permalink