Abstract
An in-place 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. In this paper we describe three in-place algorithms for computing the convex hull of a planar point set. All three algorithms are optimal, some more so than others…
Cite
CITATION STYLE
Brönnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., & Toussaint, G. (2002). In-place planar convex hull algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2286, pp. 494–507). Springer Verlag. https://doi.org/10.1007/3-540-45995-2_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
