Introducing Congestion Avoidance into CUDA Based Crowd Simulation
dc.contributor.author | Wockenfuss, Falco | en_US |
dc.contributor.author | Lürig, Christoph | en_US |
dc.contributor.editor | Jan Bender and Kenny Erleben and Eric Galin | en_US |
dc.date.accessioned | 2013-10-31T10:42:47Z | |
dc.date.available | 2013-10-31T10:42:47Z | |
dc.date.issued | 2011 | en_US |
dc.description.abstract | The simulation of larger crowds of peoples at interactive frames rates get more and more important in games and interactive simulations. Crowds contribute significantly to an immersive urban environment. The nature of the problem where one has to simulate a lot of individuals makes it very accessible for parallelization strategies. As graphics hardware today is a very accessible and powerful parallel computation hardware, the problem lends itself to be adapted to graphics hardware. It is implemented in CUDA in our case. CUDA and other parallel implementations of social force models usually have several numerical and parallelization issues that are finally based on too inhomogeneous population distributions. These are often also undesirable from a game developers point of view. In this paper we introduce the concept of congestion avoidance into the crowd simulator that solves those technical issues and makes the whole simulation also look more natural for gaming applications. | en_US |
dc.description.seriesinformation | Workshop in Virtual Reality Interactions and Physical Simulation "VRIPHYS" (2011) | en_US |
dc.identifier.isbn | 978-3-905673-87-6 | en_US |
dc.identifier.uri | https://doi.org/10.2312/PE/vriphys/vriphys11/101-110 | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.6.8 [Simulation and Modeling]: Parallel Gaming | en_US |
dc.title | Introducing Congestion Avoidance into CUDA Based Crowd Simulation | en_US |
Files
Original bundle
1 - 1 of 1