Space-efficient planar convex hull algorithms

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

Research output: Contribution to journalArticle

Abstract

A space-efficient 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. We describe four space-efficient algorithms for computing the convex hull of a planar point set.

Original languageEnglish (US)
Pages (from-to)25-40
Number of pages16
JournalTheoretical Computer Science
Volume321
Issue number1
DOIs
StatePublished - Jun 16 2004

Fingerprint

Convex Hull
Efficient Algorithms
Point Sets
Computing
Output
Data storage equipment

Keywords

  • Computational geometry
  • Convex hulls
  • In situ
  • In-place

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Brönnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., & Toussaint, G. (2004). Space-efficient planar convex hull algorithms. Theoretical Computer Science, 321(1), 25-40. https://doi.org/10.1016/j.tcs.2003.05.004

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

In: Theoretical Computer Science, Vol. 321, No. 1, 16.06.2004, p. 25-40.

Research output: Contribution to journalArticle

Brönnimann, H, Iacono, J, Katajainen, J, Morin, P, Morrison, J & Toussaint, G 2004, 'Space-efficient planar convex hull algorithms', Theoretical Computer Science, vol. 321, no. 1, pp. 25-40. https://doi.org/10.1016/j.tcs.2003.05.004
Brönnimann H, Iacono J, Katajainen J, Morin P, Morrison J, Toussaint G. Space-efficient planar convex hull algorithms. Theoretical Computer Science. 2004 Jun 16;321(1):25-40. https://doi.org/10.1016/j.tcs.2003.05.004
Brönnimann, Hervé ; Iacono, John ; Katajainen, Jyrki ; Morin, Pat ; Morrison, Jason ; Toussaint, Godfried. / Space-efficient planar convex hull algorithms. In: Theoretical Computer Science. 2004 ; Vol. 321, No. 1. pp. 25-40.
@article{862010207e974abb96a7ac0ce504999a,
title = "Space-efficient planar convex hull algorithms",
abstract = "A space-efficient 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. We describe four space-efficient algorithms for computing the convex hull of a planar point set.",
keywords = "Computational geometry, Convex hulls, In situ, In-place",
author = "Herv{\'e} Br{\"o}nnimann and John Iacono and Jyrki Katajainen and Pat Morin and Jason Morrison and Godfried Toussaint",
year = "2004",
month = "6",
day = "16",
doi = "10.1016/j.tcs.2003.05.004",
language = "English (US)",
volume = "321",
pages = "25--40",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Space-efficient planar convex hull algorithms

AU - Brönnimann, Hervé

AU - Iacono, John

AU - Katajainen, Jyrki

AU - Morin, Pat

AU - Morrison, Jason

AU - Toussaint, Godfried

PY - 2004/6/16

Y1 - 2004/6/16

N2 - A space-efficient 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. We describe four space-efficient algorithms for computing the convex hull of a planar point set.

AB - A space-efficient 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. We describe four space-efficient algorithms for computing the convex hull of a planar point set.

KW - Computational geometry

KW - Convex hulls

KW - In situ

KW - In-place

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

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

U2 - 10.1016/j.tcs.2003.05.004

DO - 10.1016/j.tcs.2003.05.004

M3 - Article

AN - SCOPUS:2442490630

VL - 321

SP - 25

EP - 40

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1

ER -