Kirkpatrick–Seidel algorithm
The Kirkpatrick–Seidel algorithm, called by its authors "the ultimate planar convex hull algorithm" is an algorithm for computing the convex hull of a set of points in the plane, with O(n log h) time complexity, where n is the number of input points and h is the number of points in the hull.
Kirkpatrick–Seidel algorithmRaimund SeidelDavid G. KirkpatrickList of algorithmsConvex hull algorithmsPolygon triangulationBeta skeletonArrangement of lines
Our Services
Do not forget to check the lastest products and auctions related to Kirkpatrick–Seidel Algorithm as well as our free videos and podcasts.
