ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Computing the area of a spherical polygon of arbitrary shape (1987)
    Springer
    Mathematical geology 19 (1987), S. 335-346 
    Details
    ISSN: 1573-8868
    Keywords: spherical ; polygon ; area ; algorithm ; FORTRAN ; subroutine
    Source: Springer Online Journal Archives 1860-2000
    Topics: Geosciences , Mathematics
    Notes: Abstract An algorithm for determining the area of a spherical polygon of arbitrary shape is presented. The kernel of the problem is to compute the interior angle at each vertex of the spherical polygon; a well-known relationship between the area of a spherical polygon and the sum of its interior angles then may be exploited. The algorithm has been implemented as a FORTRAN subroutine and a listing is provided. Both algorithm and subroutine are general in their capabilities and can be used, for example, to determine the area of a spherical polygon containing one or more holes.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00897843
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Locating a point on a spherical surface relative to a spherical polygon of arbitrary shape (1989)
    Springer
    Mathematical geology 21 (1989), S. 811-828 
    Details
    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
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...