Poisson Disk Point Sets by Hierarchical Dart Throwing

View Description

Download

small (250x250 max)

medium (500x500 max)

large ( > 500x500)

Full Resolution

PDF
Text

you wish to report:

Your comment:

Your Name:

Submit

Cancel

...

Rating
Permanent URL	http://hdl.lib.byu.edu/1877/2404
Title	Poisson Disk Point Sets by Hierarchical Dart Throwing
BYU Creator	Cline, David Egbert, Parris K.
Creator	White, Kenric B.
Keywords	computer graphics; poisson disk; sampling
Description/Abstract	Poisson disk point sets are “ideally” generated through a process of dart throwing. The naive dart throwing algorithm is extremely expensive if a maximal set is desired, however. In this paper we present a hierarchical dart throwing procedure which produces point sets that are equivalent to naive dart throwing, but is very fast. The procedure works by intelligently excluding areas known to be fully covered by existing samples. By excluding covered regions, the probability of accepting a thrown dart is greatly increased. Our algorithm is conceptually simple, performs dart throwing in O(N) time and memory, and produces a maximal point set up to the precision of the numbers being used.
Source	David Cline, Kenric B. White, Parris Egbert, "Poisson Disk Point Sets by Hierarchical Dart Throwing", Symposium on Interactive Ray Tracing, pp. 129-132, Sept. 2007.;
Publisher	IEEE
Date Original	2007-09
Date Digital	2010-09-02
Language	English eng en
Publication Type	Articles
Type	Text
Format	application/pdf
Owning Institution	Brigham Young University
BYU College	College of Physical and Mathematical Sciences
BYU Department	Computer Science
Copyright Status	(c) 2007 Institute of Electrical and Electronics Engineers;
Copyright Use Information	http://www.lib.byu.edu/generic_copyright.html

Find results with:

Searching collections:

Home Poisson Disk Point Sets by Hierarchical Dart Throwing

Poisson Disk Point Sets by Hierarchical Dart Throwing

Description

Tags

Comments