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 : Theoretical Informatics - 5th Latin American Symposium, Proceedings
PublisherSpringer Verlag
Pages494-507
Number of pages14
Volume2286
ISBN (Print)3540434003, 9783540434009
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Convex Hull
Point Sets
Data storage equipment
Computing
Output

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Brönnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., & Toussaint, G. (2002). In-place planar convex hull algorithms. In LATIN 2002 : Theoretical Informatics - 5th Latin American Symposium, Proceedings (Vol. 2286, pp. 494-507). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2286). Springer Verlag.

In-place planar convex hull algorithms. / Brönnimann, Hervé; Iacono, John; Katajainen, Jyrki; Morin, Pat; Morrison, Jason; Toussaint, Godfried.

LATIN 2002 : Theoretical Informatics - 5th Latin American Symposium, Proceedings. Vol. 2286 Springer Verlag, 2002. p. 494-507 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2286).

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

Brönnimann, H, Iacono, J, Katajainen, J, Morin, P, Morrison, J & Toussaint, G 2002, In-place planar convex hull algorithms. in LATIN 2002 : Theoretical Informatics - 5th Latin American Symposium, Proceedings. vol. 2286, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2286, Springer Verlag, pp. 494-507, 5th Latin American Symposium on Theoretical Informatics, LATIN 2002, Cancun, Mexico, 4/3/02.
Brönnimann H, Iacono J, Katajainen J, Morin P, Morrison J, Toussaint G. In-place planar convex hull algorithms. In LATIN 2002 : Theoretical Informatics - 5th Latin American Symposium, Proceedings. Vol. 2286. Springer Verlag. 2002. p. 494-507. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Brönnimann, Hervé ; Iacono, John ; Katajainen, Jyrki ; Morin, Pat ; Morrison, Jason ; Toussaint, Godfried. / In-place planar convex hull algorithms. LATIN 2002 : Theoretical Informatics - 5th Latin American Symposium, Proceedings. Vol. 2286 Springer Verlag, 2002. pp. 494-507 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bd3c6a11f0b74ec2b0cd52872e9e13ca,
title = "In-place planar convex hull algorithms",
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…",
author = "Herv{\'e} Br{\"o}nnimann and John Iacono and Jyrki Katajainen and Pat Morin and Jason Morrison and Godfried Toussaint",
year = "2002",
language = "English (US)",
isbn = "3540434003",
volume = "2286",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "494--507",
booktitle = "LATIN 2002 : Theoretical Informatics - 5th Latin American Symposium, Proceedings",

}

TY - GEN

T1 - In-place planar convex hull algorithms

AU - Brönnimann, Hervé

AU - Iacono, John

AU - Katajainen, Jyrki

AU - Morin, Pat

AU - Morrison, Jason

AU - Toussaint, Godfried

PY - 2002

Y1 - 2002

N2 - 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…

AB - 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…

UR - http://www.scopus.com/inward/record.url?scp=84937414398&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937414398&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540434003

SN - 9783540434009

VL - 2286

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 494

EP - 507

BT - LATIN 2002 : Theoretical Informatics - 5th Latin American Symposium, Proceedings

PB - Springer Verlag

ER -