Document Type
Report
Date
4-1990
Keywords
complexity analysis, computational geometry, convex hull, correctness proof, divide-and-conquer, prune-and-search, QuickHull
Language
English
Disciplines
Computer Sciences
Description/Abstract
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 formal proof of correctness.
Recommended Citation
Greenfield,, Jonathan Scott, "A Proof for a QuickHull Algorithm" (1990). Electrical Engineering and Computer Science - Technical Reports. 65.
https://surface.syr.edu/eecs_techreports/65
Source
local
Additional Information
School of Computer and Information Science, Syracuse University, SU-CIS-90-03