sevanetrebchenko / fast-poisson-disk-sampling

Implementation of 'Fast Poisson Disk Sampling in Arbitrary Dimensions' by Robert Bridson, University of British Columbia.

Fast Poisson Disk Sampling in Arbitrary Dimensions

Implementation of Fast Poisson Disk Sampling in Arbitrary Dimensions by Robert Bridson, University of British Columbia. The provided source code implements the algorithm in 2D and 3D. Extensions into input spaces of higher dimensions require slight modification of the algorithm.

Example Distribution

fast-poisson-disk-sampling's Issues

number change

You have an array of integers (initially empty).

You have to execute q queries. Each query has one of two types:

"1 x" - add element x to the end of the array;
"2 x y" - replace all occurrences of x in the array with y.
Find the array obtained after all the queries.