Chan's algorithm
id:
chan-s-algorithm-262-18472574
title:
Chan's algorithm
text:
In computational geometry, Chan's algorithm, named after Timothy M. Chan, is an optimal output-sensitive algorithm to compute the convex hull of a set P of n points, in 2- or 3-dimensional space. The algorithm takes O time, where h is the number of vertices of the output. In the planar case, the algorithm combines an O algorithm with Jarvis march, in order to obtain an optimal O time. Chan's algorithm is notable because it is much simpler than the Kirkpatrick–Seidel algorithm, and it naturally e
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm for finding the convex hull of a set of points in the plane
original url:
https://en.wikipedia.org/wiki/Chan%27s_algorithm
date created:
date modified:
2024-03-29T01:35:47Z
main entity:
{"identifier":"Q2025538","url":"https://www.wikidata.org/entity/Q2025538"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/48/ChanAlgDemo.gif","width":918,"height":324}
fields total:
13
integrity:
15