2 papers
cs.CG2016
S-hull: a fast radial sweep-hull routine for Delaunay triangulation
David Sinclair
A new O(nlog(n)) algorithm is presented for performing Delaunay triangulation of sets of 2D points. The novel component of the algorithm is a radially propagating \emph{sweep-hull}…
cs.CG2016
A 3D Sweep Hull Algorithm for computing Convex Hulls and Delaunay Triangulation
David Sinclair
This paper presents a new O(nlog(n)) algorithm for computing the convex hull of a set of 3 dimensional points. The algorithm first sorts the point in (x,y,z) then incrementally add…