A Proof for a QuickHull Algorithm
Jonathan Scott Greenfield · 1990
The planar convex hull problem is fundamental to computational geometry and has many applications, including pattern recognition and image processing. QuickHull is a simple planar convex hull algorithm analogous to Hoare's QuickSort [1]. This paper presents a pedagogical description and analysis of a QuickHull algorithm, along with a fonna! proof of correcbless.