Boids that see: Using self-occlusion for simulating large groups on gpus
ARD Silva, WS Lages, L Chaimowicz - Computers in Entertainment (CIE), 2010 - dl.acm.org
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 …
the simulation of large groups of individuals. Unfortunately, the classical models can be very …
Applicability of gpgpu computing to real-time ai solutions in games
This paper reviews developments in general purpose computing on graphics processor
units (GPGPU computing) from the perspective of video-game-related artificial intelligence …
units (GPGPU computing) from the perspective of video-game-related artificial intelligence …
A neighborhood grid data structure for massive 3d crowd simulation on gpu
Simulation and visualization of emergent crowd in real-time is a computationally intensive
task. This intensity mostly comes from the O(n^2) complexity of the traversal algorithm …
task. This intensity mostly comes from the O(n^2) complexity of the traversal algorithm …
An adaptative game loop architecture with automatic distribution of tasks between cpu and gpu
This article presents a new architecture to implement all game loop models for games and
real-time applications that use the GPU as a mathematics and physics coprocessor, working …
real-time applications that use the GPU as a mathematics and physics coprocessor, working …
[PDF][PDF] An architeture with automatic load balancing for real-time simulation and visualization systems
Nowadays, multithread hardware architectures like multi-core CPUs and GPUs found on
PCs and game consoles (as Microsoft Xbox 360 and Sony Playstation 3) are a trend. Hence …
PCs and game consoles (as Microsoft Xbox 360 and Sony Playstation 3) are a trend. Hence …
A distributed architecture for mobile digital games based on cloud computing
Several fields in Computer Science use distributed computing to solve many intensive
computational problems. Digital games use this approach mainly in multiplayer games …
computational problems. Digital games use this approach mainly in multiplayer games …
Simple and efficient approximate nearest neighbor search using spatial sorting
M de Gomensoro Malheiros… - 2015 28th SIBGRAPI …, 2015 - ieeexplore.ieee.org
Finding the nearest neighbors of a point is a highly used operation in many graphics
applications. Recently, the neighborhood grid has been proposed as a new approach for …
applications. Recently, the neighborhood grid has been proposed as a new approach for …
An architecture with automatic load balancing and distribution for digital games
Distributed computing is being used in several fields to solve many computation intensive
problems. In digital games, it is used mainly in multi-player games, where the majority of the …
problems. In digital games, it is used mainly in multi-player games, where the majority of the …
[PDF][PDF] Systèmes multi-agents et GPGPU: état des lieux et directions pour l'avenir.
Résumé Dans le domaine des systèmes multi-agents (SMA), la puissance des CPU
représente parfois un frein qui limite fortement le cadre dans lequel un modèle peut être …
représente parfois un frein qui limite fortement le cadre dans lequel un modèle peut être …
Spatial sorting: an efficient strategy for approximate nearest neighbor searching
M de Gomensoro Malheiros, M Walter - Computers & Graphics, 2016 - Elsevier
Many graphics and also non-graphics applications need efficient techniques to find the
nearest neighbors of a given query point. There are two approaches to address this …
nearest neighbors of a given query point. There are two approaches to address this …