Convex Hulls, Oracles, and Homology
| dc.creator | Joswig, Michael | |
| dc.creator | Ziegler, G"unter M. | |
| dc.date | 2003-01-10 | |
| dc.date.accessioned | 2026-07-07T04:54:22Z | |
| dc.date.available | 2026-07-07T04:54:22Z | |
| dc.description | 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). | |
| dc.description | 11 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/math/0301100 | |
| dc.identifier | http://arxiv.org/abs/math/0301100 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/66224 | |
| dc.subject | Metric Geometry | |
| dc.subject | Combinatorics | |
| dc.subject | 52B55; 05E25; 68Q25 | |
| dc.title | Convex Hulls, Oracles, and Homology | |
| dc.type | text |