Collision detection: review of methods and recent advances in crowd simulation

Crowd simulation is a large complex system that visualizes the behavior of crowd entities' movement and their interactions with the virtual environment. Crowd model is usually integrated into a virtual environment to make the environment alive. In the context of agent-based simulation (as in crowd simulation), it encompasses collision checking between moving agents that are present in the same environment. Hence, it is important to design an efficient and yet effective collision detection in crowd simulation. This is to ensure that it is cost effective toward computational processing usage and still produce a believable behavior. This paper presents a study of collision detection techniques in crowd models, and recent advancement to accelerate the process so that in turn, these efforts could also improve the performance and outcome of crowd model in virtual environment applications

Robot graphic simulation testbed

The objective of this research was twofold. First, the basic capabilities of ROBOSIM (graphical simulation system) were improved and extended by taking advantage of advanced graphic workstation technology and artificial intelligence programming techniques. Second, the scope of the graphic simulation testbed was extended to include general problems of Space Station automation. Hardware support for 3-D graphics and high processing performance make high resolution solid modeling, collision detection, and simulation of structural dynamics computationally feasible. The Space Station is a complex system with many interacting subsystems. Design and testing of automation concepts demand modeling of the affected processes, their interactions, and that of the proposed control systems. The automation testbed was designed to facilitate studies in Space Station automation concepts

Linkless octree using multi-level perfect hashing

The standard C/C++ implementation of a spatial partitioning data structure, such as octree and quadtree, is often inefficient in terms of storage requirements particularly when the memory overhead for maintaining parent-to-child pointers is significant with respect to the amount of actual data in each tree node. In this work, we present a novel data structure that implements uniform spatial partitioning without storing explicit parent-to-child pointer links. Our linkless tree encodes the storage locations of subdivided nodes using perfect hashing while retaining important properties of uniform spatial partitioning trees, such as coarse-to-fine hierarchical representation, efficient storage usage, and efficient random accessibility. We demonstrate the performance of our linkless trees using image compression and path planning examples.postprin

Searchable Sky Coverage of Astronomical Observations: Footprints and Exposures

Sky coverage is one of the most important pieces of information about astronomical observations. We discuss possible representations, and present algorithms to create and manipulate shapes consisting of generalized spherical polygons with arbitrary complexity and size on the celestial sphere. This shape specification integrates well with our Hierarchical Triangular Mesh indexing toolbox, whose performance and capabilities are enhanced by the advanced features presented here. Our portable implementation of the relevant spherical geometry routines comes with wrapper functions for database queries, which are currently being used within several scientific catalog archives including the Sloan Digital Sky Survey, the Galaxy Evolution Explorer and the Hubble Legacy Archive projects as well as the Footprint Service of the Virtual Observatory.Comment: 11 pages, 7 figures, submitted to PAS

Efficient conservative collision detection for populated virtual worlds

Large virtual worlds, with considerable level of detail are starting to emerge everywhere, from large areas of actual cities to archaeological detailed reconstructions of sites. Populating a virtual world adds an extra touch to the visualization of these worlds, but unfortunately it also brings an extra burden to the system. Several tasks are required when adding animated characters to a virtual world, such as collision detection, path planning and other AI algorithms, rendering of dynamic geometry, amongst others. In here a method for efficient and scalable conservative collision detection, that is able to deal with large scenes and thousands of avatars, is presented. This method does not perform exact collision detection, hence it is conservative. The method is suitable as a basis for path planning algorithms and other AI algorithms where an avatar is often regarded as ’something’ that can be bounded by a cylinder, or a box. The algorithm is capable of dealing with arbitrarily complex 3D worlds, and does not require any a priori knowledge of the geometry

Efficient conservative collision detection for populated virtual worlds

Large virtual worlds, with considerable level of detail are starting to emerge everywhere, from large areas of actual cities to archaeological reconstructions of large sites. Populating a virtual world adds an extra touch to the visualization of these worlds, but unfortunately it also brings an extra burden to the system. Several tasks are required when adding animated characters to a virtual world, such as collision detection, path planning and other AI algorithms, rendering of dynamic geometry, amongst others. In here a method for efficient and scalable conservative collision detection is presented, that is able to deal with large scenes and thousands of avatars. This method does not perform exact collision detection, hence it is conservative. The method is suitable as a basis for path planning algorithms and other AI algorithms where an avatar is often regarded as 'something' that can be bounded by a cylinder, or a box. The algorithm is capable of dealing with arbitrarily complex 3D worlds, and does not require any a priori knowledge of the geometry.ACM Siggraph, EG, GGC

Utilizing a 3D game engine to develop a virtual design review system

A design review process is where information is exchanged between the designers and design reviewers to resolve any potential design related issues, and to ensure that the interests and goals of the owner are met. The effective execution of design review will minimize potential errors or conflicts, reduce the time for review, shorten the project life-cycle, allow for earlier occupancy, and ultimately translate into significant total project savings to the owner. However, the current methods of design review are still heavily relying on 2D paper-based format, sequential and lack central and integrated information base for efficient exchange and flow of information. There is thus a need for the use of a new medium that allow for 3D visualization of designs, collaboration among designers and design reviewers, and early and easy access to design review information. This paper documents the innovative utilization of a 3D game engine, the Torque Game Engine as the underlying tool and enabling technology for a design review system, the Virtual Design Review System for architectural designs. Two major elements are incorporated; 1) a 3D game engine as the driving tool for the development and implementation of design review processes, and 2) a virtual environment as the medium for design review, where visualization of design and design review information is based on sound principles of GUI design. The development of the VDRS involves two major phases; firstly, the creation of the assets and the assembly of the virtual environment, and secondly, the modification of existing functions or introducing new functionality through programming of the 3D game engine in order to support design review in a virtual environment. The features that are included in the VDRS are support for database, real-time collaboration across network, viewing and navigation modes, 3D object manipulation, parametric input, GUI, and organization for 3D objects

Real-time simulation and visualisation of cloth using edge-based adaptive meshes

Real-time rendering and the animation of realistic virtual environments and characters has progressed at a great pace, following advances in computer graphics hardware in the last decade. The role of cloth simulation is becoming ever more important in the quest to improve the realism of virtual environments. The real-time simulation of cloth and clothing is important for many applications such as virtual reality, crowd simulation, games and software for online clothes shopping. A large number of polygons are necessary to depict the highly exible nature of cloth with wrinkling and frequent changes in its curvature. In combination with the physical calculations which model the deformations, the effort required to simulate cloth in detail is very computationally expensive resulting in much diffculty for its realistic simulation at interactive frame rates. Real-time cloth simulations can lack quality and realism compared to their offline counterparts, since coarse meshes must often be employed for performance reasons. The focus of this thesis is to develop techniques to allow the real-time simulation of realistic cloth and clothing. Adaptive meshes have previously been developed to act as a bridge between low and high polygon meshes, aiming to adaptively exploit variations in the shape of the cloth. The mesh complexity is dynamically increased or refined to balance quality against computational cost during a simulation. A limitation of many approaches is they do not often consider the decimation or coarsening of previously refined areas, or otherwise are not fast enough for real-time applications. A novel edge-based adaptive mesh is developed for the fast incremental refinement and coarsening of a triangular mesh. A mass-spring network is integrated into the mesh permitting the real-time adaptive simulation of cloth, and techniques are developed for the simulation of clothing on an animated character

Investigation of an emotional virtual human modelling method

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In order to simulate virtual humans more realistically and enable them life-like behaviours, several exploration research on emotion calculation, synthetic perception, and decision making process have been discussed. A series of sub-modules have been designed and simulation results have been presented with discussion. A visual based synthetic perception system has been proposed in this thesis, which allows virtual humans to detect the surrounding virtual environment through a collision-based synthetic vision system. It enables autonomous virtual humans to change their emotion states according to stimuli in real time. The synthetic perception system also allows virtual humans to remember limited information within their own First-in-first-out short-term virtual memory. The new emotion generation method includes a novel hierarchical emotion structure and a group of emotion calculation equations, which enables virtual humans to perform emotionally in real-time according to their internal and external factors. Emotion calculation equations used in this research were derived from psychologic emotion measurements. Virtual humans can utilise the information in virtual memory and emotion calculation equations to generate their own numerical emotion states within the hierarchical emotion structure. Those emotion states are important internal references for virtual humans to adopt appropriate behaviours and also key cues for their decision making. The work introduces a dynamic emotional motion database structure for virtual human modelling. When developing realistic virtual human behaviours, lots of subjects were motion-captured whilst performing emotional motions with or without intent. The captured motions were endowed to virtual characters and implemented in different virtual scenarios to help evoke and verify design ideas, possible consequences of simulation (such as fire evacuation). This work also introduced simple heuristics theory into decision making process in order to make the virtual human’s decision making more like real human. Emotion values are proposed as a group of the key cues for decision making under the simple heuristic structures. A data interface which connects the emotion calculation and the decision making structure together has also been designed for the simulation system

CONCIENS: organizational awareness in real-time strategy games

The implementation of AI in commercial games is usually based on low level designs that makes the control predictable, unadaptive, and non reusable. Recent algorithms such as HTN or GOAP prove that higher levels of abstraction can be applied for better performance. We propose that approaches based on Organizational Theory can help providing a sound alternative for these implementations. In this paper we present CONCIENS, an integration of the ALIVE organizational framework into commercial games. We introduce a proof-of-concept implementation based on the integration to Warcraft III.Peer ReviewedPostprint (author’s final draft