2013 5th International Conference on Games and Virtual Worlds for Serious Applications (VS-GAMES) 2013
DOI: 10.1109/vs-games.2013.6624227
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Mesoscopic Simulations for Persistent Agents in 3D-Applications and Games

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(7 citation statements)
references
References 11 publications
0
7
0
Order By: Relevance
“…These results suggest that the system presented in [Dettmar et al 2013] could be applied to open world environments, like Marvel's Spider-Man. The size of the road traffic network of New York City's borough Manhattan (4,493 nodes), which is the setting for the game, is well below the 15,000 node threshold.…”
Section: Resultsmentioning
confidence: 98%
See 3 more Smart Citations
“…These results suggest that the system presented in [Dettmar et al 2013] could be applied to open world environments, like Marvel's Spider-Man. The size of the road traffic network of New York City's borough Manhattan (4,493 nodes), which is the setting for the game, is well below the 15,000 node threshold.…”
Section: Resultsmentioning
confidence: 98%
“…This approach saves computational resources, but lacks persistence as agents are constantly removed from and added to the simulation instead of being continuously simulated. This type of simulation can cause inconsistent situations for a user [Dettmar et al 2013].…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…The first approach is a mesoscopic approach based on a queueing system (cf. [2]) which is integrated in the road and junction elements. Vehicles are moved through the network in form of packets containing information that needs to be preserved.…”
Section: Running Simulations On Seronetmentioning
confidence: 99%