Abstract.
A polytope is the bounded intersection of a finite set of half-spaces of \( \Bbb R$ $^d\). Every polytope can also be represented as the convex hull conv\( \cal V \) of its vertices (or extreme points) \( \cal V \) . The convex hull problem is to convert from the vertex representation to the half-space representation or (equivalently by geometric duality) vice versa. Given an ordering v 1 . . . v n of the input vertices, after some initialization an incremental convex hull algorithm constructs half-space descriptions \( \cal H \) n-k . . . \(\cal H\) n where \(\cal H\) i is the half-space description of conv {v 1 . . . v i } . Let m i denote | \( \cal H\) i |, and let m denote m n . Let φ (d) denote \( d/\lceil \sqrt{d} \rceil-1 \); in this paper we give families of polytopes for which m n-1 ∈ Ω m φ(d) ) for any ordering of the input. We also give a family of 0/1 -polytopes with a similar blowup in intermediate size. Since m n-1 is not bounded by any polynomial in m , n , and d , incremental convex hull algorithms cannot in any reasonable sense be considered output sensitive. It turns out that the same families of polytopes are also hard for the other main types of convex hull algorithms known.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received November 13, 1996, and in revised form April 28, 1997.
Rights and permissions
About this article
Cite this article
Bremner, D. Incremental Convex Hull Algorithms Are Not Output Sensitive . Discrete Comput Geom 21, 57–68 (1999). https://doi.org/10.1007/PL00009410
Issue Date:
DOI: https://doi.org/10.1007/PL00009410