Linear-Time Poisson-Disk Patterns
Name
Karger-1107.3013.pdf
Description
from arxiv: https://arxiv.org/pdf/1107.3013.pdf
Size
232.7 KB
Format
Adobe PDF
Checksum (MD5)
4f4d9f466d7de18536c7da6ccdef22e8
Author(s)
Jones, Thouis Raymond
Karger, David R
Date Issued
October 2011
Journal
Journal of Graphics GPU and Game Tools
Publisher
Taylor & Francis
Citation
Jones, Thouis R. and Karger, David R.“Linear-Time Poisson-Disk Patterns.” Journal of Graphics, GPU, and Game Tools 15, no. 3 (November 9, 2011): 177–182. © 2011 Taylor & Francis
Version
Original manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1080/2151237X.2011.617173
