Interpolation of data on the surface of a sphere
ACM Transactions on Mathematical Software (TOMS)
Computational geometry: an introduction
Computational geometry: an introduction
SIAM Journal on Numerical Analysis
Algorithm 751: TRIPACK: a constrained two-dimensional Delaunay triangulation package
ACM Transactions on Mathematical Software (TOMS)
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
Algorithm 623: Interpolation on the Surface of a Sphere
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
The Efficient Generation of Unstructured Control Volumes in 2D and 3D
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
A nodal triangle-based spectral element method for the shallow water equations on the sphere
Journal of Computational Physics
Drift-Free Real-Time Sequential Mosaicing
International Journal of Computer Vision
Appearance Based Extraction of Planar Structure in Monocular SLAM
SCIA '09 Proceedings of the 16th Scandinavian Conference on Image Analysis
Computation of three-dimensional Brinkman flows using regularized methods
Journal of Computational Physics
Network-based sparse Bayesian classification
Pattern Recognition
Centroidal Voronoi tessellation in universal covering space of manifold surfaces
Computer Aided Geometric Design
Robust and efficient delaunay triangulations of points on or close to a sphere
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Feature tracking on the hierarchical equal area triangular mesh
Computers & Geosciences
Advances in Computational Mathematics
A regularization method for the numerical solution of periodic Stokes flow
Journal of Computational Physics
Hi-index | 0.01 |
STRIPACK is a Fortran 77 software package that employs an incremental algorithm to construct a Delaunay triangulation and, optionally, a Voronoi diagram of a set of points (nodes) on the surface of the unit sphere. The triangulation covers the convex hull of the nodes, which need not be the entire surface, while the Voronoi diagram covers the entire surface. The package provides a wide range of capabilities including an efficient means of updating the triangulation with nodal additions or deletions. For N nodes, the storage requirement for the triangulation is 13N integer storage locations in addition to 3N nodal corrdinates. Using an off-line algorithm and work space of size 3N, the triangulation can be constructed with time complexity O(NlogN).