Search results
Results from the WOW.Com Content Network
In computational geometry, Chan's algorithm, [1] named after Timothy M. Chan, is an optimal output-sensitive algorithm to compute the convex hull of a set of points, in 2- or 3-dimensional space. The algorithm takes O ( n log h ) {\displaystyle O(n\log h)} time, where h {\displaystyle h} is the number of vertices of the output (the convex ...