arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1804.11295cs.CG
收藏

一般维数多面体的隶属度判定算法

Algorithms for Deciding Membership in Polytopes of General Dimension

Evangelos Anagnostopoulos, Ioannis Z. Emiris, Vissarion Fisikopoulos

摘要:

本文研究了半空间相交的高维多面凸多面体的隶属度问题。标准的数据结构以及蛮力方法由于维度的诅咒而无法扩展。我们设计了一个有效的算法,通过减少到近似最近邻(ANN)问题的基础上的沃罗诺伊图的构造与多面体是一个有界的细胞。因此,我们贸易效率的准确性,以获得复杂性界多项式的尺寸,利用最近的进展,人工神经网络搜索的复杂性。我们采用这种算法,提出了一种新的边界数据结构的基础上,牛顿式迭代相交过程。我们实现了我们的算法,并与蛮力的方法进行比较,以表明它们的规模非常好的尺寸和数量的方面越来越大。

英文摘要:

We study the fundamental problem of polytope membership aiming at large convex polytopes, i.e. in high dimension and with many facets, given as an intersection of halfspaces. Standard data-structures as well as brute force methods cannot scale, due to the curse of dimen- sionality. We design an efficient algorithm, by reduction to the approx- imate Nearest Neighbor (ANN) problem based on the construction of a Voronoi diagram with the polytope being one bounded cell. We thus trade exactness for efficiency so as to obtain complexity bounds polyno- mial in the dimension, by exploiting recent progress in the complexity of ANN search. We employ this algorithm to present a novel boundary data structure based on a Newton-like iterative intersection procedure. We implement our algorithms and compare with brute-force approaches to show that they scale very well as the dimension and number of facets grow larger.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑