Title :
Computing Prescriptions: Quickhull: Computing Convex Hulls Quickly
Abstract :
The convex hull is one of computational geometry´s fundamental structures, offering a simple way to approximate a point set´s shape. Quickhull is a simple algorithm for computing convex hulls that takes a divide-and-conquer approach and proves efficient in practice.
Keywords :
computational geometry; divide and conquer methods; computational geometry; convex hull computation; divide-and-conquer approach; point set shape; quickhull algorithm; Algorithm design and analysis; Character generation; Computational geometry; Filters; Image processing; Nails; Partitioning algorithms; Pattern recognition; Rubber; Sorting; computing prescriptions;
Journal_Title :
Computing in Science & Engineering
DOI :
10.1109/MCSE.2009.136
