On the computer generation of random convex hulls
From MaRDI portal
Publication:1155367
DOI10.1016/0898-1221(82)90035-9zbMATH Open0466.68060OpenAlexW2089594932MaRDI QIDQ1155367FDOQ1155367
Authors: Luc Devroye 
Publication date: 1982
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(82)90035-9
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer methods for sampling from gamma, beta, Poisson and binomial distributions
- An efficient algorithm for determining the convex hull of a finite planar set
- �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten. II
- Title not available (Why is that?)
- Moment inequalities for random variables in computational geometry
- ZufÄllige konvexe Polygone in einem Ringgebiet
- Sampling from binomial and Poisson distributions: a method with bounded computation times
- Divide and conquer for linear expected time
- The squeeze method for generating gamma variates
- Die konvexe H�lle von n rotationssymmetrisch verteilten Punkten
- How to reduce the average complexity of convex hull finding algorithms
- Generating discrete random variables in a computer
- Average time behavior of distributive sorting algorithms
- Squeeze Methods for Generating Gamma Variates
- Title not available (Why is that?)
- Generating the maximum of independent identically distributed random variables
- A note on linear expected time algorithms for finding convex hulls
- Computer Methods for Sampling from Student's t Distribution
- Empirical investigation of several techniques for computer generation of order statistics
- Order statistics in simulation
- On the average complexity of some bucketing algorithms
Cited In (3)
This page was built for publication: On the computer generation of random convex hulls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1155367)
