Skip to main content
Conference Proceedings

LATIN 2002: Theoretical Informatics

  • Brönnimann H
  • Iacono J
  • Katajainen J
  • et al.
DOI: 10.1007/3-540-45995-2
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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

APA

Brönnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., Toussaint, G., & Rajsbaum, S. (2002). LATIN 2002: Theoretical Informatics. In S. Rajsbaum (Ed.) (Vol. 2286, pp. 197–205). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45995-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free