def __init__(self, lons, lats):
"""
given mesh points (lons,lats in radians) define triangulation.
n is size of input mesh (length of 1-d arrays lons and lats).
Same as trintrp, but uses improved triangulation routines
from TOMS 772, and has no 'reorder' kwarg.
Algorithm:
R. J. Renka, "ALGORITHM 772: STRIPACK: Delaunay triangulation
and Voronoi diagram on the surface of a sphere"
ACM Trans. Math. Software, Volume 23 Issue 3, Sept. 1997
pp 416-434."""
if len(lons.shape) != 1 or len(lats.shape) != 1:
raise ValueError('lons and lats must be 1d')
lats = lats.astype(np.float64,copy=False)
lons = lons.astype(np.float64,copy=False)
if (np.abs(lons)).max() > 2.*np.pi:
msg="lons must be in radians (-2*pi <= lon <= 2*pi)"
raise ValueError(msg)
if (np.abs(lats)).max() > 0.5*np.pi:
msg="lats must be in radians (-pi/2 <= lat <= pi/2)"
raise ValueError(msg)
npts = len(lons)
if len(lats) != npts:
raise ValueError('lons and lats must have same length')
# compute cartesian coords on unit sphere.
x,y,z = _stripack.trans(lats,lons,npts)
lst,lptr,lend,ierr = _stripack.trmesh(x,y,z,npts)
if ierr != 0:
raise ValueError('ierr = %s in trmesh' % ierr)
self.lons = lons; self.lats = lats; self.npts = npts
self.x = x; self.y = y; self.z = z
self.lptr = lptr; self.lst = lst; self.lend = lend
def __init__(self, lons, lats):
"""
given mesh points (lons,lats in radians) define triangulation.
n is size of input mesh (length of 1-d arrays lons and lats).
Algorithm:
R. J. Renka, "ALGORITHM 772: STRIPACK: Delaunay triangulation
and Voronoi diagram on the surface of a sphere"
ACM Trans. Math. Software, Volume 23 Issue 3, Sept. 1997
pp 416-434.
Instance variables:
lats, lons: lat/lon values of N nodes (in radians)
npts: number of nodes (N).
x, y, z: cartesian coordinates corresponding to lats, lons.
lst: 6*(N-2) nodal indices, which along with
with lptr and lend, define the triangulation as a set of N
adjacency lists; counterclockwise-ordered sequences of neighboring nodes
such that the first and last neighbors of a boundary node are boundary
nodes (the first neighbor of an interior node is arbitrary). In order to
distinguish between interior and boundary nodes, the last neighbor of
each boundary node is represented by the negative of its index.
The indices are 1-based (as in Fortran), not zero based (as in python).
lptr: Set of 6*(N-2) pointers (indices)
in one-to-one correspondence with the elements of lst.
lst(lptr(i)) indexes the node which follows lst(i) in cyclical
counterclockwise order (the first neighbor follows the last neighbor).
The indices are 1-based (as in Fortran), not zero based (as in python).
lend: N pointers to adjacency lists.
lend(k) points to the last neighbor of node K. lst(lend(K)) < 0 if and
only if K is a boundary node.
The indices are 1-based (as in Fortran), not zero based (as in python).
"""
if len(lons.shape) != 1 or len(lats.shape) != 1:
raise ValueError('lons and lats must be 1d')
lats = lats.astype(np.float64,copy=False)
lons = lons.astype(np.float64,copy=False)
lons = lons.clip(-2.*np.pi,2.*np.pi)
if (np.abs(lons)).max() > 2.*np.pi:
msg="lons must be in radians (-2*pi <= lon <= 2*pi)"
raise ValueError(msg)
if (np.abs(lats)).max() > 0.5*np.pi:
msg="lats must be in radians (-pi/2 <= lat <= pi/2)"
raise ValueError(msg)
npts = len(lons)
if len(lats) != npts:
raise ValueError('lons and lats must have same length')
# compute cartesian coords on unit sphere.
x,y,z = _stripack.trans(lats,lons,npts)
lst,lptr,lend,ierr = _stripack.trmesh(x,y,z,npts)
if ierr != 0:
raise ValueError('ierr = %s in trmesh' % ierr)
self.lons = lons; self.lats = lats; self.npts = npts
self.x = x; self.y = y; self.z = z
self.lptr = lptr; self.lst = lst; self.lend = lend
def __init__(self, lons, lats):
"""
given mesh points (lons,lats in radians) define triangulation.
n is size of input mesh (length of 1-d arrays lons and lats).
Algorithm:
R. J. Renka, "ALGORITHM 772: STRIPACK: Delaunay triangulation
and Voronoi diagram on the surface of a sphere"
ACM Trans. Math. Software, Volume 23 Issue 3, Sept. 1997
pp 416-434.
Instance variables:
lats, lons: lat/lon values of N nodes (in radians)
npts: number of nodes (N).
x, y, z: cartesian coordinates corresponding to lats, lons.
lst: 6*(N-2) nodal indices, which along with
with lptr and lend, define the triangulation as a set of N
adjacency lists; counterclockwise-ordered sequences of neighboring nodes
such that the first and last neighbors of a boundary node are boundary
nodes (the first neighbor of an interior node is arbitrary). In order to
distinguish between interior and boundary nodes, the last neighbor of
each boundary node is represented by the negative of its index.
The indices are 1-based (as in Fortran), not zero based (as in python).
lptr: Set of 6*(N-2) pointers (indices)
in one-to-one correspondence with the elements of lst.
lst(lptr(i)) indexes the node which follows lst(i) in cyclical
counterclockwise order (the first neighbor follows the last neighbor).
The indices are 1-based (as in Fortran), not zero based (as in python).
lend: N pointers to adjacency lists.
lend(k) points to the last neighbor of node K. lst(lend(K)) < 0 if and
only if K is a boundary node.
The indices are 1-based (as in Fortran), not zero based (as in python).
"""
if len(lons.shape) != 1 or len(lats.shape) != 1:
raise ValueError('lons and lats must be 1d')
lats = lats.astype(np.float64,copy=False)
lons = lons.astype(np.float64,copy=False)
if (np.abs(lons)).max() > 2.*np.pi:
msg="lons must be in radians (-2*pi <= lon <= 2*pi)"
raise ValueError(msg)
if (np.abs(lats)).max() > 0.5*np.pi:
msg="lats must be in radians (-pi/2 <= lat <= pi/2)"
raise ValueError(msg)
npts = len(lons)
if len(lats) != npts:
raise ValueError('lons and lats must have same length')
# compute cartesian coords on unit sphere.
x,y,z = _stripack.trans(lats,lons,npts)
lst,lptr,lend,ierr = _stripack.trmesh(x,y,z,npts)
if ierr != 0:
raise ValueError('ierr = %s in trmesh' % ierr)
self.lons = lons; self.lats = lats; self.npts = npts
self.x = x; self.y = y; self.z = z
self.lptr = lptr; self.lst = lst; self.lend = lend
def __init__(self, lons, lats):
"""
given mesh points (lons,lats in radians) define triangulation.
n is size of input mesh (length of 1-d arrays lons and lats).
Same as trintrp, but uses improved triangulation routines
from TOMS 772, and has no 'reorder' kwarg.
Algorithm:
R. J. Renka, "ALGORITHM 772: STRIPACK: Delaunay triangulation
and Voronoi diagram on the surface of a sphere"
ACM Trans. Math. Software, Volume 23 Issue 3, Sept. 1997
pp 416-434."""
if len(lons.shape) != 1 or len(lats.shape) != 1:
raise ValueError('lons and lats must be 1d')
lats = lats.astype(np.float64, copy=False)
lons = lons.astype(np.float64, copy=False)
if (np.abs(lons)).max() > 2. * np.pi:
msg = "lons must be in radians (-2*pi <= lon <= 2*pi)"
raise ValueError(msg)
if (np.abs(lats)).max() > 0.5 * np.pi:
msg = "lats must be in radians (-pi/2 <= lat <= pi/2)"
raise ValueError(msg)
npts = len(lons)
if len(lats) != npts:
raise ValueError('lons and lats must have same length')
# compute cartesian coords on unit sphere.
x, y, z = _stripack.trans(lats, lons, npts)
lst, lptr, lend, ierr = _stripack.trmesh(x, y, z, npts)
if ierr != 0:
raise ValueError('ierr = %s in trmesh' % ierr)
self.lons = lons
self.lats = lats
self.npts = npts
self.x = x
self.y = y
self.z = z
self.lptr = lptr
self.lst = lst
self.lend = lend
