.png){kind=icon}
返回
Spherical coverage verification
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2012.03.014.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of covering hypersphere by a set of spherical hypercaps. This sort of problem has numerous practical applications such as error correcting codes and reverse k-nearest neighbor problem. Using the reduction of non-degenerated concave quadratic programming (QP) problem, we demonstrate that spherical coverage verification is NP hard. We propose a recursive algorithm based on reducing the problem to several lower dimension subproblems. We test the performance of the proposed algorithm on a number of generated constellations. We demonstrate that the proposed algorithm, in spite of its exponential worst-case complexity, is applicable in practice. In contrast, our results indicate that spherical coverage verification using QP solvers that utilize heuristics, due to numerical instability, may produce false positives. (C) 2012 Elsevier Inc. All rights reserved.
Keyword:
Geometrical algorithms
Quadratic programming
Hypersphere
Coverage
Hypercaps
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
查看更多机构
引用论文
.png){kind=icon}
分享收藏AB0720 SOLUBLE TRANSFERRIN RECEPTOR IN DIAGNOSIS OF IRON DEFICIENCY ANEMIA IN PATIENTS WITH SPONDYLOARTHRITISAB0720 可溶性转铁蛋白受体在诊断强直性脊柱炎患者缺铁性贫血中的应用OAAI
OAAI分享收藏
没有更多内容