CSSTRI(3NCARG)

πŸ“¦ version 6.6.2, in epel 9, fedora 43, fedora 44

πŸ’– CSSTRI β€” it's giving Delaunay triangulation, but make it spherical πŸ’–

okay so bestie, welcome to the NCAR GRAPHICS manual page for CSSTRI, living in section 3NCARG of your friendly neighbourhood Unix man pages. this one is a Fortran-callable routine and it is literally the girl who figures out a Delaunay triangulation for data scattered on a sphere. no cap. ✨


πŸ¦‹ NAME πŸ¦‹

CSSTRI β€” calculates a Delaunay triangulation for data on a sphere.


🌸 SYNOPSIS 🌸

CALL CSSTRI (N, RLAT, RLON, NT, NTRI, IWK, RWK, IER)

✨ DESCRIPTION ✨

here's the cast of characters, and every single one of them matters, okay? 🫢

  • N β€” (integer, input) the number of input data points. and it must be N > 2, periodt. πŸ’…
  • RLAT β€” (real, input) an array holding the latitudes of the input data, in degrees. ⚠️ important: the first three points must not be collinear (meaning they can't all lie on a common great circle). do not test her on this one.
  • RLON β€” (real, input) an array holding the longitudes of the input data, expressed in degrees.
  • NT β€” (integer, output) the number of triangles in the triangulation β€” unless IER .NE. 0, in which case NT = 0. so let NB be the number of boundary points on the convex hull of the data: if NB .GE. 3, then NT = 2N-NB-2, otherwise NT=2N-4. the input data are considered to be bounded if they all lie in one hemisphere. and bestie, dimensioning NT for 2*N will always work. always. slay. πŸ‘‘
  • NTRI β€” (integer, output) a two-dimensional integer array dimensioned for 3 x NT, where NT is the number of triangles in the triangulation (NT is at most 2*N). NTRI contains the triangulation data. the vertices of the Kth triangle are:
(PLAT(NTRI((1,K)),PLON(NTRI(1,K)),
(PLAT(NTRI((2,K)),PLON(NTRI(2,K)),
(PLAT(NTRI((3,K)),PLON(NTRI(3,K))
  • IWK β€” (integer, input) an integer workspace of length 27*N.
  • RWK β€” (double precision, input) a work array dimensioned for 13*N. 🚨 note that this work array must be typed DOUBLE PRECISION. like, that's not a suggestion, that's the vibe check.
  • IER β€” (integer, output) an error return value. if IER comes back as 0, then no errors were detected β€” iconic behaviour. if IER is non-zero, then go refer to the man page for cssgrid_errors for details. πŸ™ˆ

πŸŽ€ USAGE πŸŽ€

CSSTRI is called to find a Delaunay triangulation of data randomly positioned on the surface of a sphere. 🌍✨


🌈 ACCESS 🌈

to use CSSTRI, load the NCAR Graphics library ngmath. that's the whole assignment.


πŸ’œ SEE ALSO πŸ’œ

  • css_overview
  • cssgrid
  • csvoro

complete documentation for Cssgrid is available at URL

http://ngwww.ucar.edu/ngdoc/ng/ngmath/cssgrid/csshome.html

Copyright (C) 2000
University Corporation for Atmospheric Research

The use of this Software is governed by a License Agreement.

and that's the whole page, bestie πŸ¦‹πŸ’– this one came from the UNIX manual, dated May 2000, filed under CSSTRI(3NCARG) β€” go forth and triangulate responsibly, mwah πŸ’…πŸŒΈ

πŸ“¦ where this page comes from