Show simple item record

dc.contributor.authorJones, Thouis Raymond
dc.contributor.authorKarger, David R
dc.date.accessioned2017-04-13T18:11:11Z
dc.date.available2017-04-13T18:11:11Z
dc.date.issued2011-10
dc.date.submitted2011-02
dc.identifier.issn2151-237X
dc.identifier.issn2151-2272
dc.identifier.urihttp://hdl.handle.net/1721.1/108124
dc.description.abstractWe 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.en_US
dc.language.isoen_US
dc.publisherTaylor & Francisen_US
dc.relation.isversionofhttp://dx.doi.org/10.1080/2151237X.2011.617173en_US
dc.rightsArticle 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.en_US
dc.sourceProf. Karger via Phoebe Ayresen_US
dc.titleLinear-Time Poisson-Disk Patternsen_US
dc.typeArticleen_US
dc.identifier.citationJones, 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 & Francisen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorJones, Thouis Raymond
dc.contributor.mitauthorKarger, David R
dc.relation.journalJournal of Graphics GPU and Game Toolsen_US
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsJones, Thouis R.; Karger, David R.en_US
dspace.embargo.termsNen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-0024-5847
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record