A note on linear expected time algorithms for finding convex hulls
type: Item
instance of: scholarly article
title: A note on linear expected time algorithms for finding convex hulls
zbMATH Open document ID: 0438.68029
DOI: 10.1007/BF02237955
author: Godfried Toussaint
author: Luc Devroye
published in: Computing
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 52A10
zbMATH DE Number: 3684911
zbMATH Keywords: convex hulls
zbMATH Keywords: average complexity
zbMATH Keywords: geometrical complexity
zbMATH Keywords: algorithms
MaRDI profile type: Publication
cites work: A fast convex hull algorithm
cites work: Divide and conquer for linear expected time
cites work: On the Average Number of Maxima in a Set of Vectors and Applications
cites work: Optimal Expected-Time Algorithms for Closest Point Problems
cites work: Die konvexe H�lle von n rotationssymmetrisch verteilten Punkten
cites work: Average time behavior of distributive sorting algorithms
cites work: A note on finding convex hulls via maximal vectors
cites work: How to reduce the average complexity of convex hull finding algorithms
cites work: Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
cites work: A New Convex Hull Algorithm for Planar Sets
cites work: Q5512461
cites work: An efficient algorithm for determining the convex hull of a finite planar set
cites work: On the identification of the convex hull of a finite set of points in the plane
full work available at URL: https://doi.org/10.1007/bf02237955
OpenAlex ID: W1599239418
description: scientific article; zbMATH DE number 3684911