Interpolation of data on the surface of a sphere
ACM Transactions on Mathematical Software (TOMS)
Bubble mesh: automated triangular meshing of non-manifold geometry by sphere packing
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
The point in polygon problem for arbitrary polygons
Computational Geometry: Theory and Applications
Uniform spherical grids via equal area projection from the cube to the sphere
Journal of Computational and Applied Mathematics
Feature tracking on the hierarchical equal area triangular mesh
Computers & Geosciences
An octahedral equal area partition of the sphere and near optimal configurations of points
Computers & Mathematics with Applications
| Hi-index | 0.00 |
A new scheme is presented for binning globally distributed measurements. The scheme is based on a network of evenly distributed grid points, defined by repeated subdivision of a spherical icosahedron. Delanuany triangulation is then used to obtain bin perimeters for each grid point, which results in a network of bins that are evenly distributed across the entire globe and have uniform area. A modified winding rule is used to determine which datapoints are in which bin. This binning method is especially suited to remote sensing applications involving datasets covering polar regions, where conventional rectangular latitude/longitude bins introduce distortion and streaking into the binned data if noise is present. It also has the property that adjacent bins overlap, providing Nyquist sampling and preventing spatial aliasing. Tests on synthetic data show that this icosahedral binning scheme preserves underlying data trends and is robust to noise.