GitHub

How does the algorithm perform in higher dimensions? (e.g. 7D sphere in R^8)

The question you asked about internal ray facet intersections on the stack exchange a while ago is something I've been referencing in conjunction with MATLAB's implementation of the quickhull ...
GitHub

A pure javascript implementation of the QuickHull algorithm for finding the smallest polygon enclosing a set of points

let QuickHull = require('quickhull'); let points = [ {x: 1, y:1}, {x: 5, y: 10}, {x: 4, y: 11}, {x: 9, y: 2} ]; let hull = QuickHull(points); console.log(JSON ...
IEEE

A Combined Skyline Algorithm Based on Quickhull and BNL

Abstract: Skyline computation has been widely used in many research areas such as database visualization, data mining and multi-criteria decision. In this paper, we focus on a simple and effective ...
University of Oslo

Algorithms for Convex Hull

The complexity of QuickHull (the algorithm which you are asked to implement in Oblig 4) is O(n^2). The optimal complexity is O(n lg n). Graham's scan is optimal. An efficient parallel algorithm will ...
www.cs.cmu.edu

Planar Convex-Hull

Our next example solves the planar convex hull problem: Given n points in a plane, find which of them lie on the perimeter of the smallest convex region that contains all points. This example shows ...