Challenge 1 (easy): modify the code so that it works for any resolution (width, height)
, e.g. 640 x 480
.
Challenge 2 (medium): implement Bridson's Poisson disk sampling algorithm with other Python packages, use the same config with this repo (400x400 grid and 100K desired points) and whatever acceleration tricks you can. See if you can beat the speed of Taichi. (the compile time will not be counted)
Challenge 3 (hard): improve the code so that the result is a maximal Poisson sampling, that is, there won't be any room left to insert new points.
Please submit your work in this issue.
pip3 install -r requirements.txt
Mouse and keyboard control:
- Click mouse to choose an initial point.
- Press
p
to save screenshots.
Exmaple:
See this repo:
https://github.com/taichi-dev/taichi_benchmark/tree/main/poisson
You are encouraged to implement a faster one to beat ours!