On the computer generation of random convex hulls
From MaRDI portal
(Redirected from Publication:1155367)
Cites work
- scientific article; zbMATH DE number 3426632 (Why is no real title available?)
- scientific article; zbMATH DE number 3233336 (Why is no real title available?)
- scientific article; zbMATH DE number 3354336 (Why is no real title available?)
- scientific article; zbMATH DE number 3393603 (Why is no real title available?)
- A note on linear expected time algorithms for finding convex hulls
- An efficient algorithm for determining the convex hull of a finite planar set
- Average time behavior of distributive sorting algorithms
- Computer Methods for Sampling from Student's t Distribution
- Computer methods for sampling from gamma, beta, Poisson and binomial distributions
- Die konvexe H�lle von n rotationssymmetrisch verteilten Punkten
- Divide and conquer for linear expected time
- Empirical investigation of several techniques for computer generation of order statistics
- Generating discrete random variables in a computer
- Generating the maximum of independent identically distributed random variables
- How to reduce the average complexity of convex hull finding algorithms
- Moment inequalities for random variables in computational geometry
- On the average complexity of some bucketing algorithms
- Order statistics in simulation
- Sampling from binomial and Poisson distributions: a method with bounded computation times
- Squeeze Methods for Generating Gamma Variates
- The squeeze method for generating gamma variates
- ZufÄllige konvexe Polygone in einem Ringgebiet
- �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten. II
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)
