An efficient search algorithm for minimum covering polygons on the sphere

SIAM Journal on Scientific Computing

Volumn 35, Issue 3, 2013, Pages

  Wang, Ning ^a  

^a Veterinary Dentistry and Oral Surgery   (United States)

Author keywords

Minimum covering spherical polygon; Modified kd tree; Nearest neighbor search; Unstructured grid

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; LOCATION; NEAREST NEIGHBOR SEARCH; NUMERICAL MODELS; TREES (MATHEMATICS);

DATA SET; GRID POINTS; K-D TREE; LINEAR SEARCH; MINIMUM COVERING SPHERICAL POLYGON; MODIFIED KD-TREE; NEAR NEIGHBOR SEARCHES; SEARCH ALGORITHMS; TREE ALGORITHMS; UNSTRUCTURED GRID;

SPHERES;

EID: 84884916824     PISSN: 10648275     EISSN: 10957200     Source Type: Journal    
DOI: 10.1137/120880331     Document Type: Article

References (25)

1. P. K. Agarwal and J. Erickson, Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry 23, B. Chazelle, J. E. Goodman, and R. Pollack, eds., AMS, Providence, RI, 1998, p. 156.
2. P. Agarwal and J. Matou?sek, Ray shooting and parametric search, in Proceedings of the 24th ACM Symposium on the Theory of Computing, 1992, pp. 517-526.
3. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu, An optimal algorithm for approximate nearest neighbor searching, in Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 573-582.
4. A. Baede, M. Jarraud, and U. Cubasch, Adiabatic Formulation and Organization of ECMWF's Spectral Model, Technical report, European Centre for Medium Range Weather Forecasts, Reading, UK, 1979.
5. J. R. Baumgardner and P. O. Frederickson, Icosahedral discretization of the two-sphere, SIAM J. Numer. Anal., 22 (1985), pp. 1107-1115.
6. J. Bentley, B. Weide, and A. Yao, Optimal expected-time algorithms for closest point problems, ACM Trans. Math. Software, 6 (1980), pp. 563-580.
7. J. Bentley, Multidimensional binary search trees used for associative searching, Comm. ACM, 18 (1975), pp. 509-517.
8. S. Brin, Near neighbor search in large metric spaces, in Proceedings of the 21st International Conference on Very Large Data Bases, 1995, pp. 574-584.
9. K. L. Clarkson, A randomized algorithm for closest-point queries, SIAM J. Comput., 17 (1988), pp. 830-847.
10. K. L. Clarkson, An algorithm for approximate closest-point queries, in Proceedings of the 10th ACM Symposium on Computational Geometry, 1994, pp. 160-164.
11. C. Feustel and L. Shapiro, The nearest neighbor problem in an abstract metric space, Pattern Recognition Letters, 2 (1982), pp. 125-128.
12. J. H. Friedman, J. L. Bentley, and R. A. Finkel, An algorithm for finding best matches in logarithmic expected time, ACM Trans. Math. Software, 3 (1977), pp. 209-226.
13. P. Indyk and R. Motwani, Approximate nearest neighbors: Towards removing the curse of dimensionality, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 604-613.
14. P. W. Jones, First and second-order conservative remapping schemes for grids in spherical coordinates, Mon. Wea. Rev., 127 (1998), pp. 2204-2210.
15. M. Kanamitsu, Description of the NMC global data assimilation and forecast system, Wea. Forecasting, 4 (1989), pp. 335-342.
16. J.-L. Lee and A. E. MacDonald, A finite-volume icosshedral shallow water model on local coordinate, Mon. Wea. Rev., 137 (2009), pp. 1422-1437.
17. D. Majewski, D. LierMann, P. Prohl, B. Ritter, M. Buchhold, T. Hanisch, G. Paul, and W. Wergen, The operational global icosahedral-hexagonal gridpoint model GME: Description and high-resolution tests, Mon. Wea. Rev., 130 (2002), pp. 319-338.
18. S. A. Orszag, Transform method for calculation of vector coupled sums: Application to the spectral form of the vorticity equation, J. Atmos. Sci., 27 (1970), pp. 890-895.
19. W. M. Putman and S.-J. Lin, A finite-volume dynamical core on the cubed-sphere grid, in Numerical Modeling of Space Plasma Flows: Astronum-2008, Astronomical Society of the Pacific Conference Series 406, 2009, pp. 268-276.
20. R. Swinbank and J. Purser, Fibonacci grids: A novel approach to global modelling, Q.J.R. Meteorol. Soc., 117 (2006), pp. 1769-1793.
21. H. Tomita, K. Goto, and M. Satoh, A new approach to atmospheric general circulation model: Global cloud resolving model NICAM and its computational performance, SIAMJ. Sci. Comput., 30 (2008), pp. 2755-2776.
22. H. Tomita, M. Satoh, and K. Goto, A new dynamical framework of global nonhydrostatic model using the icosahedral grid, Fluid Dyn. Res., 34 (2004), pp. 357-400.
23. N.Wang and J. Lee, Geometric properties of the icosahedral-hexagonal grid on the two-sphere, SIAM J. Sci. Comput., 33 (2011), pp. 2536-2559.
24. W. M. Washington and C. L. Parkinson, An introduction to three-dimensional climate modeling, University Science Books, Sausalito, CA, 2005.
25. P. N. Yianilos, Data structures and algorithms for nearest neighbor search in general metric spaces, in Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 311-321.