Hamzah Asyrani Sulaiman

Advanced Computer and Communication Engineering Technology

The first € price and the £ and

Balanced hierarchical construction in collision detection for rigid bodies

price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with ** include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. All errors and omissions excepted. H.A. Sulaiman, M.A. Othman, M.F.I. Othman, Y.A. Rahim, N.C. Pee (Eds.) Advanced Computer and Communication Engineering Technology

Bounding-Volume Hierarchies Technique for Detecting Object Interference in Urban Environment Simulation

Performing collision detection between rigid bodies in virtual environment is always the common problem for researchers. Determination of a precise contact within appropriate time response can eventually end up with only one option that collision detection can support which is either speed or accuracy. For most three-dimensional (3D) application, discrete collision detection (DCD) is the most preferable compared to continuous collision detection (CCD) as it creates fast response. DCD commonly used hierarchical representation in order to create space volume representing an object. Hence, in this paper we introduce a technique called Split Object Median Splitting (SOMS) that improves the hierarchical representation of 3D object in order to create fast collision detection method suitable for 3D application such as games and animations. The experimental result shows that our method has the ability to construct well-balanced Bounding-Volume Hierarchies (BVH) tree.

A new Orthogonal - Diamond Search algorithm for Motion Estimation

Performing and detecting object interference or collision detection in urban environment simulation is always challenging problem for researchers to come out with fast and efficient collision detection algorithm. Most of previous method seems trying to tackle the problems of involving specific geometric models colliding pairs with restricted rules and guidelines. For example, convex hull bounding-volume tends to solve the collision detection problems by make the collision more accurate. However, its limitation of performing fast collision detection method must be left behind. Hence, in this paper we introduce new traversal algorithm using Bounding-Volume Hierarchies (BVH) for collision detection in urban environment simulation. By using hierarchical approach, the efficiency of detecting object interference in urban simulation is increase. We believe that BVH method can be useful in urban simulation for collision detection between static rigid models and dynamic rigid models. Thus it should be able to overcome the equipment of urban environment simulation. Our result shows that bounding-volume hierarchies achieve favorable frame-rates in real time simulation using top-down binary tree. In practice, the construction of bounding-volume hierarchies in urban environment simulation are not just useful for collision detection but they also useful for others detecting object interference technique such culling and raytracing.

Wireless network visualization in 3D virtual environment framework

Many fast Block Matching Algorithm or BMA have been proposed and developed in recent years in order to reduce the computational cost while maintaining the quality of the video signal. In this paper, a new Orthogonal-Diamond Search (ODS) is proposed which employs an orthogonal-shaped search pattern in the first step and then is switched into small diamond-shaped search pattern for the next step. The proposed algorithm and several established algorithms, namely Full Search (FS), Three-Step Search (TSS) and Diamond Search (DS) are implemented using MATLAB and their performance are being compared and analyzed in terms of computational complexity, peak signal-to-noise ratio (PSNR), and number of search points. Simulation result shows that the proposed algorithm can find motion vector with fewer number of search points while maintains close performance of video quality with other selected algorithms.

On Faster Bounding Volume Hierarchy Construction for Avatar Collision Detection

Simulating a signal propagation of wireless cognitive network has been widely accepted by researchers in order to come out with three-dimensional (3D) representation data display. Instead of using primitive way to understand the behavior of signal propagation, 3D visualization of wireless networking could also help researchers to study the limitation and exploration of wireless cognitive network deeply. In this paper, we would like to address the requirement and the potential of using 3D representation to visualize properly the wireless cognitive network. We also performed preliminary test of our 3D visualization system using OpenGL graphic library to visualize the propagation of signal travelling in specific room with several medium. The test has been conducted in order to understand the requirement of wireless cognitive network in 3D visualization before the actual system is built.

Distance approximation using pivot point in narrow phase collision detection

In many interactive computer graphics applications, users are represented as virtual characters called avatars. Collision detection is a pre-requisite in interactive computer graphics application so that appropriate response and realistic behaviour can be generated. However, it will not be easy to anticipate collisions since objects’ motion are dependant on user interaction and avatar manipulation. Ideally, collision detection needs to be done efficiently, with accurate result in the shortest time possible. However, due to its computationally intensive nature, collision detection could cause a bottleneck to the system. A variety of techniques, data structures and algorithms were proposed to accelerate the collision detection process. Acceleration data structures are widely used not only to promote faster collision detection, but also in the field of ray tracing and deformable objects simulation. This paper discusses the use of bounding volume hierarchy as an acceleration data structure in collision detection for avatar in virtual environment, as well as similar methods used in interactive ray tracing and deformable objects simulation. Based on these findings, method for fast bounding volume hierarchy construction is proposed as a first step towards efficient avatar collision detection.

Two-pass assembler design for a reconfigurable RISC processor

Discrete and Continuous Collision Detection is two common fields in Collision Detection research area where it helps to determine time and point of contact when two object intersect. Each technique increase speed and accuracy of the simulation itself but depending on application, we need to have specific solution of collision detection technique. Most computer games and simulation maintain speed as the main important elements while others such as medical and mechanical simulation needs to have a very high precision collision detection technique. Thus, an algorithm for the optimal distance computation algorithm for continuous collision detection is shown in this paper. The basic idea is to use an AABB for both object triangles and creating a moveable origin point called Dynamic Origin Point (DyOP). DyOP created by using minimum and maximum point of both AABBs where it dynamically changes whenever the object move. This is a novel algorithm that works better than the previously known Gilbert Keerthi-Johnson algorithm and Lin-Canny algorithm where it helps to reduce the complicated test and implementation. We have shown that our technique is performed faster than the previous algorithms by increasing speed and nearly approximate the good distance between two nearly intersected triangles.

Balanced Hierarchical Method of Collision Detection in Virtual Environment

Hardware software co-design plays a crucial part in the embedded processor development especially with the current advancement of reconfigurable platforms. The reconfigurability features offered by platforms such as Field Programmable Gate Array (FPGA) has permitted the modification of the internal processor architecture with lower cost and higher performance. While the hardware architecture could be changed through various methods, the modifications need to be complemented with a compatible assembler that suits the amended architecture. This paper presents a two-pass assembler design technique that adapts to any instruction set architecture (ISA) modifications being applied on a reconfigurable processor. A Reduced Instruction Set Computer (RISC) processor core, which is described in Verilog Hardware Description Language (HDL), is used as the testing platform whereby its ISA is expanded to include new instruction sets. The assembler is developed based on two-pass approach and the assembling process would generate a coefficient file that is used as initialization files during the FPGA implementation of the processor core. The assemblers have been successfully developed with correct output format and verified during the FPGA implementation using Xilinx Spartan-3AN board.

Fast Traversal Algorithm for Detecting Object Interference Using Hierarchical Representation between Rigid Bodies

Determine the successful configuration between rigid bodies that come into contact is always a fundamental problem in computer visualization problem. Given the simulation that needs to maintain the speed of intersection, it is not always fast enough to compute the complete iteration between moving polyhedral. In this paper, we introduced a splitting algorithm that is able to successfully divide the hierarchical construction in virtual environment. By enhancing the capabilities of splitting rules of Bounding-Volume Hierarchies (BVH), the construction of BVH is improved and is able to provide fast collision detection method between two successive configurations.