Abstract / Description of output
In this paper we propose a method to determine the flow of large crowds of agents in a scene such that it is filled to capacity with smoothly moving agents. Our approach provides a focus on coordinated and cooperative motion across
the entire crowd. This is done with a view to providing control which animators can use to quickly and easily populate and fill a scene, in addition to other previous methods. We solve this global planning problem by first finding the topology of the scene using a Reeb graph which is computed from a harmonic field of the environment. The max-flow can then be calculated across this graph providing paths which the agents can follow throughout the space. We demonstrate the effectiveness of our system in creating smooth motion through comparison to another recent method.
the entire crowd. This is done with a view to providing control which animators can use to quickly and easily populate and fill a scene, in addition to other previous methods. We solve this global planning problem by first finding the topology of the scene using a Reeb graph which is computed from a harmonic field of the environment. The max-flow can then be calculated across this graph providing paths which the agents can follow throughout the space. We demonstrate the effectiveness of our system in creating smooth motion through comparison to another recent method.
| Original language | English |
|---|---|
| Title of host publication | CISA 2013 Proceedings for the 26th International Conference on Computer Animation and Social Agents |
| Number of pages | 4 |
| Publication status | Published - May 2013 |
Keywords / Materials (for Non-textual outputs)
- crowd coordination
- Topology