arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0301100math.MGmath.CO

Convex Hulls, Oracles, and Homology

Michael Joswig, G"unter M. Ziegler

英文摘要:

This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a simplicial homology computation. Like other convex hull algorithms, our algorithm is polynomial (in the size of input plus output) for simplicial or simple input. We show that the ``no''-case of POLYTOPE-COMPLETENESS-COMBINATORIAL has a certificate that can be checked in polynomial time (if integrity of the input is guaranteed).

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

↑