Skip to search formSkip to main contentSkip to account menu

Quickhull

Quickhull is a method of computing the convex hull of a finite set of points in the plane. It uses a divide and conquer approach similar to that of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Convex hullList of algorithmsPolymakeQuicksort

Broader (1)

Convex hull algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Partial Flattening: A Compilation Technique for Irregular Nested Parallelism on GPGPUs
Supporting irregular nested parallelism on modern GPUs requires much effort. One should distribute the parallel tasks evenly… 
2008
2008
A New Algorithm for Finding Convex Hull with a Maximum Pitch of the Dynamical Base Line
In this paper, a representative algorithm convex hull with half-dividing and recurrence is commented; and according to the… 
2008
2008
Cronus: A platform for parallel code generation based on computational geometry methods
2007
2007
Comparison Between Mimetic and Two-Point Flux-Approximation Schemes on PEBI-grids
Review
2007
Review
2007
Visualization of Algorithms from Computational Geometry using QuickTime ® Movies
QuickTime® movies provide students of computational geometry with a useful pedagogical tool that helps them to follow, implement… 
2007
2007
A Paradigm for Divide and Conquer Algorithms on the GPU and its Application to the Quickhull Algorithm
We present a divide and conquer paradigm for dataparallel architectures and use it to implement the Quickhull algorithm to find… 
2006
2006
CTH12-1: Efficient Calculation of BER for Arbitrary Modulation and Signaling in Fading Channels
We present a numerically efficient method to evaluate exactly uncoded bit error rate for transmission in fading channels. The… 
2004
2004
Visualizing the Connection Among Convex Hull , Voronoi Diagram and Delaunay Triangulation
The convex hull, Voronoi diagram and Delaunay triangulation are all essential concepts in computational geometry. Algorithms for… 
1998
1998
Colorant Selection for Six-Color Lithographic Printing
Two criteria for selecting ink sets for six-color lithographic printing are discussed. The first is the volume, in CIELAB space… 
1995
1995
Randomized Quick Hull
This paper contains a simple, randomized algorithm for constructing the convex hull of a set of n points in the plane with… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)