Overview
Poisson disk object placement uses distance constraints to scatter objects across a domain while avoiding overlaps or dense clusters.
Places objects with a minimum spacing so distributions look natural but not clumped.
Compact metadata for implementation and discovery.
Poisson disk object placement uses distance constraints to scatter objects across a domain while avoiding overlaps or dense clusters.
Quick facts
Runtime and memory behavior at a glance.
Best
O(n)
Average
O(n)
Worst
O(n^2)
Space
O(n)
distance(sample_i, sample_j) >= rAccepts samples only if they are far enough from existing samples.
Show the generation state evolving from seed values to the final artifact.
Poisson Disk Object Placement should be used with the assumptions and tradeoffs of spatial Distribution in mind.
What each reference supports for this entry.
Reference for fast Poisson disk sampling used for blue-noise object placement.
Open sourceGood next jumps from the relationship graph, ranked for useful discovery.
Object placement uses Poisson disk sampling to keep points well separated.
Both distribute samples with coverage constraints.