An efficient search algorithm for minimum covering polygons on the sphere

DOI10.1137/120880331MaRDI QIDQ2847730zbMATH OpenOpenAlexFDO

Authors 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

nearest neighbor searchunstructured gridminimum covering spherical polygonmodified \(kd\)-tree

Mathematics Subject Classification ID

Data structures (68P05) 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)

Recommendations

• A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
• A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
• scientific article; zbMATH DE number 1522573
• Minimal length tree networks on the unit sphere
• Spherical minimax location problem

Cited in

(2)

• Covering a simplex by spheres: complexity and algorithms
• Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere

This page was built for publication: An efficient search algorithm for minimum covering polygons on the sphere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2847730)