A Simple Algorithm for Maximal Poisson-Disk Sampling in High Dimensions
We provide a simple algorithm and data structures for d‐dimensional unbiased maximal Poisson‐disk sampling. We use an order of magnitude less memory and time than the alternatives. Our results become more favorable as the dimension increases. This allows us to produce bigger samplings. Domains may b...
Saved in:
Published in | Computer graphics forum Vol. 31; no. 2pt4; pp. 785 - 794 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
Oxford, UK
Blackwell Publishing Ltd
01.05.2012
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!