| Abstract Space-Efficient Planar Convex Hull Algorithms 1 (2008) | |||||||||||||||||
Abstract | |||||||||||||||||
| A space-efficient algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. We describe four space-efficient algorithms for computing the convex hull of a planar point set. | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||