Coordinated Crowd Simulation With Topological Scene Analysis
| dc.contributor.author | Barnett, Adam | en_US |
| dc.contributor.author | Shum, Hubert P. H. | en_US |
| dc.contributor.author | Komura, Taku | en_US |
| dc.contributor.editor | Chen, Min and Zhang, Hao (Richard) | en_US |
| dc.date.accessioned | 2016-09-27T10:02:03Z | |
| dc.date.available | 2016-09-27T10:02:03Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | This paper proposes a new algorithm to produce globally coordinated crowds in an environment with multiple paths and obstacles. Simple greedy crowd control methods easily lead to congestion at bottlenecks within scenes, as the characters do not cooperate with one another. In computer animation, this problem degrades crowd quality especially when ordered behaviour is needed, such as soldiers marching towards a castle. Similarly, in applications such as real‐time strategy games, this often causes player frustration, as the crowd will not move as efficiently as it should. Also, planning of building would usually require visualization of ordered evacuation to maximize the flow. Planning such globally coordinated crowd movement is usually labour intensive. Here, we propose a simple solution that is easy to use and efficient in computation. First, we compute the harmonic field of the environment, taking into account the starting points, goals and obstacles. Based on the field, we represent the topology of the environment using a Reeb Graph, and calculate the maximum capacity for each path in the graph. With the harmonic field and the Reeb Graph, path planning of crowd can be performed using a lightweight algorithm, such that any blocking of one another's paths is minimized. Comparing to previous methods, our system can synthesize globally coordinated crowd with smooth and efficient movement. It also enables control of the crowd with high‐level parameters such as the degree of cooperation and congestion. Finally, the method is scalable to thousands of characters with minimal impact to computation time. It is best applied in interactive crowd synthesis systems such as animation designs and real‐time strategy games.This paper proposes a new algorithm to produce globally coordinated crowds in an environment with multiple paths and obstacles. Simple greedy crowd control methods easily lead to congestion at bottlenecks within scenes, as the characters do not cooperate with one another. In computer animation, this problem degrades crowd quality especially when ordered behaviour is needed, such as soldiers marching towards a castle. Similarly, in applications such as real‐time strategy games, this often causes player frustration, as the crowd will not move as efficiently as it should. Also, planning of building would usually require visualization of ordered evacuation to maximize the flow. Planning such globally coordinated crowd movement is usually labour intensive. | en_US |
| dc.description.number | 6 | |
| dc.description.sectionheaders | Articles | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 35 | |
| dc.identifier.doi | 10.1111/cgf.12735 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 120-132 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.12735 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf12735 | |
| dc.publisher | Copyright © 2016 The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | motion planning | |
| dc.subject | I.3.7[Computer Graphics]: Three‐Dimensional Graphics and Realism–Animation | |
| dc.title | Coordinated Crowd Simulation With Topological Scene Analysis | en_US |