Interactive Collision Detection Research Articles

Rancang Bangun Game 3D Edukasi Basic Web Development Menggunakan Unity 3D

The development of games is a media that is favored by the public which can have good or bad effects, where a game is basically made as for entertainment but there are also those who use games as educational media. This research was conducted to create a basic web development educational game packaged in the form of RPG (Role Playing Games) games with the result that providing basic web development education that can be played by all audience, where learning about web development is currently quite popular with some people. The game system design process is made using UML diagrams which will be applied to the unity 3D application and the assessment obtained through a questionnaire of 82% of respondents agreed that this game can be provide basic web development education. This game is also implemented using a finite state machine algorithm that controls enemy behavior in each state and collision detection for interaction with other objects. In this process create several interface designs and also for the finite state machine algorithm implemented to the enemy animator to control the state of enemy behavior, and the collision detection algorithm is applied to areas that have a collider to display the interface and also play background music.

Interactive collision detection for engineering plants based on large-scale point-clouds

ABSTRACTIn this paper, we discuss interactive collision detection for large-scale point-clouds. The state-of-the-art laser scanners enable us to capture dense point-clouds from engineering plants. Dense point-clouds are useful for simulating renovation tasks of engineering plants. However, it is difficult to interactively calculate collisions between 3D models and huge point-clouds. We propose an efficient collision detection method for large-scale point-clouds, and discuss an interactive system for collision detection. In our method, collisions are evaluated on two-resolution depth-maps. Our method allows us to precisely and efficiently detect collisions with large-scale point-clouds. The experimental results showed that our system could interactively detect collisions in large-scale point-clouds.

A Brain Surgery Simulator

A proposed real-time neurosurgery simulator handles skull drilling and surgical interaction with the brain. This involves the development and combination of areas such as collision handling, haptic rendering, physical simulation, and volumetric visualization. The simulator's input data comes from computed-tomography and magnetic-resonance-imaging images of the patients. Collision detection for drilling uses only density data; collision detection for interaction with the brain is based on uniform spatial subdivision of a tetrahedral mesh. To take advantage of all the information, the simulator employs visualization methods such as volumetric isosurfaces and deformable volume rendering.

A geospatial technique for detecting distance and Reflection Angle between real and virtual objects

This paper presents a geospatial collision detection technique consisting of two methods: Find Object Distance (FOD) and Find Reflection Angle (FRA). We show how the geospatial collision detection technique using a computer vision system detects a computer generated virtual object and a real object manipulated by a human user and how the virtual object can be reflected on a real floor after being detected by a real object. In the geospatial collision detection technique, the FOD method detects the real and virtual objects, and the FRA method predicts the next moving directions of virtual objects. We demonstrate the two methods by implementing a floor based Augmented Reality (AR) game, Ting Ting, which is played by bouncing fire-shaped virtual objects projected on a floor using bamboo-shaped real objects. The results reveal that the FOD and the FRA methods of the geospatial collision detection technique enable the smooth interaction between a real object manipulated by a human user and a virtual object controlled by a computer. The proposed technique is expected to be used in various AR applications as a low cost interactive collision detection engine such as in educational materials, interactive contents including games, and entertainment equipments. Keywords: Augmented reality, collision detection, computer vision, game, human computer interaction, image processing, interfaces.

Interactive collision detection in three-dimensional visualizations of simulated construction operations

This paper presents research that led to the design and implementation of fast and interactive collision detection methods that can be used to identify and report undesirable conflicts that occur among static (e.g., structure in-place, idle equipment), dynamic (e.g., active machines and workers), and abstract (e.g., hazard spaces) construction resources in 3D animations of construction operations modeled using discrete-event simulation. Computational efficiency and interactive speed in the designed interference detection methods were the primary challenges that the research addressed. In addition, the efficiency and speed were achieved with minimal trade-off against accuracy. In order to achieve this, the authors capitalized on advanced documented algorithms for proximity queries between arbitrarily moving 3D geometric objects to design mechanisms for interference detection, control, and response in construction process visualizations. The designed methods are implemented in a software tool called C-Collide that integrates as an add-on with the VITASCOPE visualization system.

Interactive collision detection between deformable models using chromatic decomposition

We present a novel algorithm for accurately detecting all contacts, including self-collisions, between deformable models. We precompute a chromatic decomposition of a mesh into non-adjacent primitives using graph coloring algorithms. The chromatic decomposition enables us to check for collisions between non-adjacent primitives using a linear-time culling algorithm. As a result, we achieve higher culling efficiency and significantly reduce the number of false positives. We use our algorithm to check for collisions among complex deformable models consisting of tens of thousands of triangles for cloth modeling and medical simulation. Our algorithm accurately computes all contacts at interactive rates. We observed up to an order of magnitude speedup over prior methods.

Three-dimensional simulation and prediction of craniofacial surgery.

The treatment of patients with complex facial deformities is one of the most challenging multidisciplinary tasks in plastic surgery. Due to advancements in medical technology and surgical techniques in the last 20 years correction of severe malformations has become possible and is performed by highly specialized teams frequently in a single operation. Recent developments in three-dimensional (3-D) imaging techniques have already greatly facilitated diagnosis of complex craniofacial deformities. Computer-based simulation methods for surgical procedures that are based on imaging data have the potential to improve surgical treatment by providing the ability to perform 'virtual surgery' preoperatively and thus reduce patient risk and morbidity intraoperatively. A method is presented for interactive computer-assisted craniofacial plastic surgery planning and visualization, especially simulation of soft tissue changes using an experimental Craniofacial Surgery Planner. The system computes non-linear soft-tissue deformation because of bone realignment. It is capable of simulating bone cutting and bone realignment with integrated interactive collision detection. Furthermore, soft-tissue deformation and cutting due to surgical instruments can be visualized. Simulation processes are based on an individual patient's preoperative 3-D computed tomography and on a 3-D, photo-realistic model of the patient's preoperative appearance obtained by a laser range scanner. Very fast and robust prediction of non-linear soft-tissue deformation is computed by optimizing a non-linear cost function.

Fast and accurate collision detection for haptic interaction using a three degree-of-freedom force-feedback device

We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we precompute a hybrid hierarchical representation, consisting of uniform grids (represented using a hash table) and trees of tight-fitting oriented bounding box trees (OBBTrees). At run time, we use hybrid hierarchical representations and exploit frame-to-frame coherence for fast proximity queries. We describe a new overlap test, which is specialized for intersection of a line segment with an oriented bounding box for haptic simulation and takes 42–72 operations including transformation costs. The algorithms have been implemented as part of H-COLLIDE and interfaced with a PHANToM arm and its haptic toolkit, GHOST, and applied to a number of models. As compared to the commercial implementation, we are able to achieve up to 20 times speedup in our experiments and sustain update rates over 1000 Hz on a 400 MHz Pentium II. In practice, our prototype implementation can accurately and efficiently detect contacts between a virtual probe guided by a force-feedback arm and large complex geometries composed of tens of thousands of polygons, with substained KHz rates.

Fast and accurate collision detection for haptic interaction using a three degree-of-freedom force-feedback device

Fast and accurate collision detection for haptic interaction using a three degree-of-freedom force-feedback device

Partitioning and Handling Massive Models for Interactive Collision Detection

We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to interactive data access and processing in a large geometric database, which may not fit into main memory of typical desktop workstations or computers. We present a new algorithm using overlap graphs for localizing the “regions of interest” within a massive model, thereby reducing runtime memory requirements. The overlap graph is computed off‐line, pre‐processed using graph partitioning algorithms, and modified on the fly as needed. At run time, we traverse localized sub‐graphs to check the corresponding geometry for proximity and pre‐fetch geometry and auxiliary data structures. To perform interactive proximity queries, we use bounding‐volume hierarchies and take advantage of spatial and temporal coherence. Based on the proposed algorithms, we have developed a system called IMMPACT and used it for interaction with a CAD model of a power plant consisting of over 15 million triangles. We are able to perform a number of proximity queries in real‐time on such a model. In terms of model complexity and application to large models, we have improved the performance of interactive collision detection and proximity computation algorithms by an order of magnitude.