How to reduce the average complexity of convex hull finding algorithms

From MaRDI portal
Publication:1151049


DOI10.1016/0898-1221(81)90059-6zbMath0456.68080MaRDI QIDQ1151049

Luc P. Devroye

Publication date: 1981

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(81)90059-6


68Q25: Analysis of algorithms and problem complexity

52A20: Convex sets in (n) dimensions (including convex hypersurfaces)

52A22: Random convex sets and integral geometry (aspects of convex geometry)

68R99: Discrete mathematics in relation to computer science


Related Items



Cites Work