An Efficient Search Algorithm for Minimum Covering Polygons on the Sphere

DOI10.1137/120880331zbMath1273.68104OpenAlexW2033470070MaRDI QIDQ2847730

Ning Wang

Publication date: 11 September 2013

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a65ee0bb44a6a9a6aff4f8abcd336b5ce18def6a

zbMATH Keywords

unstructured gridnearest neighbor searchminimum covering spherical polygonmodified \(kd\)-tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Data structures (68P05)

This page was built for publication: An Efficient Search Algorithm for Minimum Covering Polygons on the Sphere