Linear-Time Poisson-Disk Patterns

Author(s)
Jones, Thouis Raymond; Karger, David R
Thumbnail
Downloadfrom arxiv: https://arxiv.org/pdf/1107.3013.pdf (232.7Kb)
OPEN_ACCESS_POLICY
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.
Metadata
Show full item record
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.
Date issued
2011-10
URI
http://hdl.handle.net/1721.1/108124
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
ISSN
2151-237X
2151-2272
Collections