Document Type

Report

Date

4-1990

Embargo Period

4-30-2012

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.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-90-03

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.