McCabeism: Fast Multiscale Turing Patterns
3.1 هزار بار بازدید -
10 سال پیش
-
This is a variant of
This is a variant of Jonathan McCabe's Multiscale Turing Patterns algorithm. It uses a Gaussian neighborhood when computing scale variation densities, split into two 1D Gaussian passes. The original instead uses a uniformly-weighted 2D circular neighborhood. By splitting the neighborhood calculations into two 1D passes the per-pixel complexity of the algorithm is reduced from O(n^2) to O(n), where n is the largest scale parameter. This complexity reduction makes it feasible to render much longer, higher-resolution animations.
Stats:
Resolution: 2048x1024
Render time: ~12 hours
Frames: 24000
Framerate: 60 fps
Created using Ready https://code.google.com/p/reaction-di...
Ready VTI file: https://www.dropbox.com/s/o08sf821v95...
Stats:
Resolution: 2048x1024
Render time: ~12 hours
Frames: 24000
Framerate: 60 fps
Created using Ready https://code.google.com/p/reaction-di...
Ready VTI file: https://www.dropbox.com/s/o08sf821v95...
10 سال پیش
در تاریخ 1393/11/11 منتشر شده
است.
3,113
بـار بازدید شده