Flocks, herds and schools: A distributed behavioral model
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Particle Systems—a Technique for Modeling a Class of Fuzzy Objects
ACM Transactions on Graphics (TOG)
A Unified Hierarchical Algorithm for Global Illumination with Scattering Volumes and Object Clusters
IEEE Transactions on Visualization and Computer Graphics
The Prioritized-Layered Projection Algorithm for Visible Set Estimation
IEEE Transactions on Visualization and Computer Graphics
Cg: a system for programming graphics hardware in a C-like language
ACM SIGGRAPH 2003 Papers
Hardware-based simulation and collision detection for large particle systems
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation (Gpu Gems)
Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation
ACM SIGGRAPH 2006 Papers
Proceedings of the 2006 ACM SIGGRAPH symposium on Videogames
OpenGL(R) Programming Guide: The Official Guide to Learning OpenGL(R), Version 2 (5th Edition) (OpenGL)
Simulation of large crowds in emergency situations including gaseous phenomena
CGI '05 Proceedings of the Computer Graphics International 2005
Real-time particle systems on the GPU in dynamic environments
ACM SIGGRAPH 2007 courses
Crowd Simulation
A survey of visibility for walkthrough applications
IEEE Transactions on Visualization and Computer Graphics
A synthetic-vision based steering approach for crowd simulation
ACM SIGGRAPH 2010 papers
FAME, soft flock formation control for collective behavior studies and rapid games development
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
| Hi-index | 0.00 |
Behavioral models have been used in the entertainment industry to increase the realism in the simulation of large groups of individuals. Unfortunately, the classical models can be very compute-intensive when very large groups are considered, reducing its applicability in games and other interactive systems. In this article we explore both search space reduction and parallelism to improve the performance of Reynold's Boids model. We propose a methodology that considers self-occlusion (visibility culling) to reduce the number of neighbors and we take advantage the parallelism present in common graphics processor units (GPUs) to allow the simulation of very large groups. We performed different GPU implementations (GPGPU and CUDA); the results show that visibility culling allows significant gains in performance without affecting the model's overall behavior.