In-place planar convex hull algorithms

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

doi:10.1007/3-540-45995-2_43

In-place planar convex hull algorithms

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

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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.

Original language	English (US)
Title of host publication	LATIN 2002
Subtitle of host publication	Theoretical Informatics - 5th Latin American Symposium, Proceedings
Editors	Sergio Rajsbaum
Publisher	Springer Verlag
Pages	494-507
Number of pages	14
ISBN (Electronic)	3540434003, 9783540434009
DOIs	https://doi.org/10.1007/3-540-45995-2_43
State	Published - 2002
Event	5th Latin American Symposium on Theoretical Informatics, LATIN 2002 - Cancun, Mexico Duration: Apr 3 2002 → Apr 6 2002

Publication series

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

Other

Other	5th Latin American Symposium on Theoretical Informatics, LATIN 2002
Country/Territory	Mexico
City	Cancun
Period	4/3/02 → 4/6/02

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-45995-2_43

Cite this

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

In-place planar convex hull algorithms. / Brönnimann, Hervé; Iacono, John; Katajainen, Jyrki et al.
LATIN 2002: Theoretical Informatics - 5th Latin American Symposium, Proceedings. ed. / Sergio Rajsbaum. 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 proceeding › Conference contribution

Brönnimann, H, Iacono, J, Katajainen, J, Morin, P, Morrison, J & Toussaint, G 2002, In-place planar convex hull algorithms. in S Rajsbaum (ed.), LATIN 2002: Theoretical Informatics - 5th Latin American Symposium, Proceedings. 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. https://doi.org/10.1007/3-540-45995-2_43

Brönnimann H, Iacono J, Katajainen J, Morin P, Morrison J, Toussaint G. In-place planar convex hull algorithms. In Rajsbaum S, editor, LATIN 2002: Theoretical Informatics - 5th Latin American Symposium, Proceedings. Springer Verlag. 2002. p. 494-507. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45995-2_43

Brönnimann, Hervé ; Iacono, John ; Katajainen, Jyrki et al. / In-place planar convex hull algorithms. LATIN 2002: Theoretical Informatics - 5th Latin American Symposium, Proceedings. editor / Sergio Rajsbaum. 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.",

author = "Herv{\'e} Br{\"o}nnimann and John Iacono and Jyrki Katajainen and Pat Morin and Jason Morrison and Godfried Toussaint",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 5th Latin American Symposium on Theoretical Informatics, LATIN 2002 ; Conference date: 03-04-2002 Through 06-04-2002",

year = "2002",

doi = "10.1007/3-540-45995-2_43",

language = "English (US)",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "494--507",

editor = "Sergio Rajsbaum",

booktitle = "LATIN 2002",

}

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.

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.

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

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

U2 - 10.1007/3-540-45995-2_43

DO - 10.1007/3-540-45995-2_43

M3 - Conference contribution

AN - SCOPUS:84937414398

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

A2 - Rajsbaum, Sergio

PB - Springer Verlag

T2 - 5th Latin American Symposium on Theoretical Informatics, LATIN 2002

Y2 - 3 April 2002 through 6 April 2002

ER -

In-place planar convex hull algorithms

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this