CSSTRID(3NCARG)
π CSSTRID β the Delaunay-triangulation-on-a-sphere girlie π
okay so bestie, welcome to the NCAR GRAPHICS corner of the manual pages π. Today's main character is CSSTRID, and she's here to serve you a whole Delaunay triangulation of points scattered across a sphere. No cap, it's giving computational geometry but make it β¨cuteβ¨. Grab a strawberry π, sit down, and let's get into it.
β¨ NAME β¨
CSSTRID β calculates a Delaunay triangulation for data on a sphere π¦
πΈ SYNOPSIS πΈ
CALL CSSTRID (N, RLAT, RLON, NT, NTRI, IWK, RWK, IER)
like, that's the whole summoning ritual. say it with your chest π
π DESCRIPTION π
okay here's the cast of characters, one by one, no skipping, we don't do that here π«Ά
N(integer, input) β the number of input data points. And it's gotta beN > 2, because triangulating two points is not a vibe, bestie, you literally cannot.RLAT(double precision, input) β an array holding the latitudes of the input data, expressed in degrees. β οΈ Important lore: the first three points must not be collinear, meaning they cannot lie on a common great circle. If they do? That's a problem, and we don't do problems. πRLON(double precision, input) β an array holding the longitudes of the input data, also expressed in degrees. Yes it's a separate array, yes you need both, that's just the lore. πNT(integer, output) β the number of triangles in the triangulation! π Exceptβplot twistβifIER .NE. 0, thenNT = 0. The math of it, whereNBis the number of boundary points on the convex hull of the data: ifNB .GE. 3, thenNT = 2N-NB-2; otherwiseNT = 2N-4. The input data are considered to be bounded if they all lie in one hemisphere. And honestly? DimensioningNTfor2*Nwill always work. always. slay. πNTRI(integer, output) β a two-dimensional integer array dimensioned for3 x NT, whereNTis the number of triangles in the triangulation (NTis at most2*N).NTRIcontains 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))
yeah we're just gonna let that sit there exactly as it is, iconic behavior, no notes π₯
IWK(integer, input) β an integer workspace of length27*N. yes, twenty-seven times N. she needs room to think. π§RWK(double precision, input) β a work array dimensioned for13*N. π And listen: this work array must be typedDOUBLE PRECISION. Do not come in here with single precision, I am begging you. πIER(integer, output) β the error return value! IfIERcomes back as0, then no errors were detected, we love a clean run, we love a flawless serve β¨. IfIERis non-zero, then go refer to the man page forcssgrid_errorsfor the details β she will tell you exactly what went wrong, iykyk.
π¦ USAGE π¦
CSSTRID is called to find a Delaunay triangulation of data randomly positioned on the surface of a sphere. π And the tea: CSSTRID is a double precision version of CSSTRI. So if you're out here wanting the double-precision experience, you're in the right place, bestie. π
π ACCESS π
To use CSSTRID, load the NCAR Graphics library ngmath. that's it, that's the whole access requirement, periodt. π
π SEE ALSO π
css_overviewcssgridcsstricsvoro
Complete documentation for Cssgrid is available at URL http://ngwww.ucar.edu/ngdoc/ng/ngmath/cssgrid/csshome.html πΈ
π COPYRIGHT π
Copyright (C) 2000 University Corporation for Atmospheric Research
The use of this Software is governed by a License Agreement.
fr fr, read the license, bestie, it's the rules. π«Ά
and that's the whole page!! π
NCAR Graphics girlies stay winning, this one dropped back in May 2000 and she's still serving CSSTRID(3NCARG) energy to this very day. go forth, triangulate your sphere, and remember: double precision work arrays only. mwah πβ¨π¦
π¦ where this page comes from
- epel 9: ncl-devel 6.6.2-59.el9 Β· LicenseRef-Callaway-BSD
- fedora 43: ncl-devel 6.6.2-58.fc43 Β· LicenseRef-Callaway-BSD
- fedora 44: ncl-devel 6.6.2-62.fc44 Β· LicenseRef-Callaway-BSD
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms