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: | English |
| Published: |
Taylor & Francis,
2017-04-13T18:11:11Z.
|
| Subjects: | |
| Online Access: | Get fulltext |