A note on linear expected time algorithms for finding convex hulls

L. Devroye, Godfried Toussaint

Research output: Contribution to journalArticle

Abstract

Consider n independent identically distributed random vectors from Rd with common density f, and let E (C) be the average complexity of an algorithm that finds the convex hull of these points. Most well-known algorithms satisfy E (C)=0(n) for certain classes of densities. In this note, we show that E (C)=0(n) for algorithms that use a "throw-away" pre-processing step when f is bounded away from 0 and ∞ on any nondegenerate rectangle of R2.

Original languageEnglish (US)
Pages (from-to)361-366
Number of pages6
JournalComputing
Volume26
Issue number4
DOIs
StatePublished - Dec 1 1981

Fingerprint

Convex Hull
Average Complexity
Random Vector
Identically distributed
Rectangle
Preprocessing
Processing
Class

Keywords

  • algorithms
  • average complexity
  • Convex hull
  • geometrical complexity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Numerical Analysis
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this

A note on linear expected time algorithms for finding convex hulls. / Devroye, L.; Toussaint, Godfried.

In: Computing, Vol. 26, No. 4, 01.12.1981, p. 361-366.

Research output: Contribution to journalArticle

@article{7c7b11bd9c2a47b28946454185b29bad,
title = "A note on linear expected time algorithms for finding convex hulls",
abstract = "Consider n independent identically distributed random vectors from Rd with common density f, and let E (C) be the average complexity of an algorithm that finds the convex hull of these points. Most well-known algorithms satisfy E (C)=0(n) for certain classes of densities. In this note, we show that E (C)=0(n) for algorithms that use a {"}throw-away{"} pre-processing step when f is bounded away from 0 and ∞ on any nondegenerate rectangle of R2.",
keywords = "algorithms, average complexity, Convex hull, geometrical complexity",
author = "L. Devroye and Godfried Toussaint",
year = "1981",
month = "12",
day = "1",
doi = "10.1007/BF02237955",
language = "English (US)",
volume = "26",
pages = "361--366",
journal = "Computing (Vienna/New York)",
issn = "0010-485X",
publisher = "Springer Wien",
number = "4",

}

TY - JOUR

T1 - A note on linear expected time algorithms for finding convex hulls

AU - Devroye, L.

AU - Toussaint, Godfried

PY - 1981/12/1

Y1 - 1981/12/1

N2 - Consider n independent identically distributed random vectors from Rd with common density f, and let E (C) be the average complexity of an algorithm that finds the convex hull of these points. Most well-known algorithms satisfy E (C)=0(n) for certain classes of densities. In this note, we show that E (C)=0(n) for algorithms that use a "throw-away" pre-processing step when f is bounded away from 0 and ∞ on any nondegenerate rectangle of R2.

AB - Consider n independent identically distributed random vectors from Rd with common density f, and let E (C) be the average complexity of an algorithm that finds the convex hull of these points. Most well-known algorithms satisfy E (C)=0(n) for certain classes of densities. In this note, we show that E (C)=0(n) for algorithms that use a "throw-away" pre-processing step when f is bounded away from 0 and ∞ on any nondegenerate rectangle of R2.

KW - algorithms

KW - average complexity

KW - Convex hull

KW - geometrical complexity

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

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

U2 - 10.1007/BF02237955

DO - 10.1007/BF02237955

M3 - Article

VL - 26

SP - 361

EP - 366

JO - Computing (Vienna/New York)

JF - Computing (Vienna/New York)

SN - 0010-485X

IS - 4

ER -