Optimization for neighbor lookup on the point grid.
authorLukas Tönne <lukas.toenne@gmail.com>
Sat, 13 Dec 2014 11:04:43 +0000 (12:04 +0100)
committerLukas Tönne <lukas.toenne@gmail.com>
Sat, 13 Dec 2014 11:04:43 +0000 (12:04 +0100)
commit6e4da2c4656583c79071a62688e5307f836a6da1
treebd6578422ef4efc20d63523afa79a1babe1e5774
parentcc472d7af79dd2df2c62cf9fa3a96e0b9fc96611
Optimization for neighbor lookup on the point grid.

As suggested in the paper, "Poisson Disk Point Sets by Hierarchical Dart
Throwing", points can be stored in adjacent cells of the point grid.
This increases memory usage somewhat, but greatly improves lookup times.
object_physics_meadow/hierarchical_dart_throw.py