In-place planar convex hull algorithms

Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried Toussaint

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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…

Original languageEnglish (US)
Title of host publicationLATIN 2002
Subtitle of host publicationTheoretical Informatics - 5th Latin American Symposium, Proceedings
EditorsSergio Rajsbaum
PublisherSpringer Verlag
Pages494-507
Number of pages14
ISBN (Electronic)3540434003, 9783540434009
DOIs
StatePublished - 2002
Event5th Latin American Symposium on Theoretical Informatics, LATIN 2002 - Cancun, Mexico
Duration: Apr 3 2002Apr 6 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2286
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th Latin American Symposium on Theoretical Informatics, LATIN 2002
CountryMexico
CityCancun
Period4/3/024/6/02

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'In-place planar convex hull algorithms'. Together they form a unique fingerprint.

Cite this