The quickhull algorithm for determining the convex hull of a finite set of discs in plane
Speaker: Nguyen Kieu Linh

Time: 9h00, Wednesday, November 14, 2018
Location: Rom 302, Building A5, Institute of Mathematics
Abstract: We present an efficient algorithm for determining the convex hull of a finite set of discs in the plane, applying the idea of a powerful algorithm for a finite set of points, namely Quickhull algorithm, which was discovered independently in 1977 by Eddy and in 1978 by Bykat. Some experiments show that our algorithm is feasible.

Back