Kirkpatrick–Seidel algorithm
id:
kirkpatrick-seidel-algorithm-236-5426905
title:
Kirkpatrick–Seidel algorithm
text:
The Kirkpatrick–Seidel algorithm, proposed by its authors as a potential "ultimate planar convex hull algorithm", is an algorithm for computing the convex hull of a set of points in the plane, with O time complexity, where n is the number of input points and h is the number of points in the hull. Thus, the algorithm is output-sensitive: its running time depends on both the input size and the output size. Another output-sensitive algorithm, the gift wrapping algorithm, was known much earlier, but
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Kirkpatrick%E2%80%93Seidel_algorithm
date created:
date modified:
2021-11-15T04:19:54Z
main entity:
{"identifier":"Q4060672","url":"https://www.wikidata.org/entity/Q4060672"}
image:
fields total:
13
integrity:
13