DeepAI AI Chat

Linear-Time Poisson-Disk Patterns

07/15/2011

∙

by Thouis R. Jones, et al.

∙

MIT

∙

∙

We present an algorithm for generating Poisson-disc patterns taking O(N) time to generate N points. The method is based on a grid of regions which can contain no more than one point in the final pattern, and uses an explicit model of point arrival times under a uniform Poisson process.

Thouis R. Jones
3 publications
David R. Karger
5 publications

page 1

page 2

page 3

page 4

∙ 02/10/2019

Scattering Statistics of Generalized Spatial Poisson Point Processes

We present a machine learning model for the analysis of randomly generat...

0 Michael Perlmutter, et al. ∙

∙ 01/02/2021

Image-based Textile Decoding

A textile fabric consists of countless parallel vertical yarns (warps) a...

0 Siqiang Chen, et al. ∙

∙ 03/20/2019

Algorithms of evaluation of the waiting time and the modelling of the terminal activity

This paper approaches the application of the waiting model with Poisson ...

0 Gh. Miscoi, et al. ∙

∙ 05/20/2021

Poisson Modeling and Predicting English Premier League Goal Scoring

The English Premier League is well-known for being not only one of the m...

0 Quang Nguyen, et al. ∙

∙ 12/15/2020

Generating from the Strauss Process using stitching

The STrauss process is a point process with unnormalized density with re...

0 Mark Huber, et al. ∙

∙ 07/29/2019

Modelling spine locations on dendrite trees using inhomogeneous Cox point processes

Dendritic spines, which are small protrusions on the dendrites of a neur...

0 Heidi S. Christensen, et al. ∙

∙ 11/26/2021

Variable resolution Poisson-disk sampling for meshing discrete fracture networks

We present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) ...

0 Johannes Krotz, et al. ∙

Code Repositories

linear-poisson-disk

Example implementation for "Linear-Time Poisson-Disk Patterns" by Jones & Karger, 2011

view repo