Linear-Time Poisson-Disk Patterns
We present an algorithm for generating Poisson-disk patterns taking O(N) time to generate N points. The method is based on a grid of regions that can contain no more than one point in the final pattern, and which uses an explicit model of point-arrival times under a uniform Poisson process.
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Taylor & Francis
2017
|
| Online Access: | http://hdl.handle.net/1721.1/108124 https://orcid.org/0000-0002-0024-5847 |