Subscribe

Issue No.05 - September/October (2009 vol.11)

pp: 54-57

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MCSE.2009.136

ABSTRACT

<p>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.</p>

INDEX TERMS

computing prescriptions

CITATION

Ernst Mücke, "Quickhull: Computing Convex Hulls Quickly",

*Computing in Science & Engineering*, vol.11, no. 5, pp. 54-57, September/October 2009, doi:10.1109/MCSE.2009.136REFERENCES