Distance Computation between Convex Objects using Axis-Aligned Bounding-Box in Virtual Environment Application

Performing collision detection between convex objects in virtual environment simulation is one of vital problems in computer visualization research area. Given a set of two or more colliding objects, in order to determine the exact point of contact between object we need to undergo various high computation algorithm. In this paper, we describes our current work of determining the precise contact by measuring the distance between near colliding objects in order to maintain the accuracy and improve the speed of collision detection algorithm. Common method determine the distance by checking for vertices and edges point between objects in brute force condition. Compared to our method, by given set of objects in virtual environment world, we find the closest point between near colliding objects and bound the potential colliding area with an Axis-Aligned Bounding-Box. Then, we approximate the distance by measuring the distance of the box itself and hence recognize potential colliding area faster than the common method. Our method proven to most effective and efficient for narrow phase collision detection by removing unnecessary testing and reduced computational cost

Distance Approximation using Pivot Point in Narrow Phase Collision Detection

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

Development of Real-Time Virtual Environment with Hierarchical Construction

The development of real-time virtual environment is always a fundamental task for research to come out with a good testing procedure. Regardless any software application that has been used to develop the virtual environment, maintaining real-time aspect such as physic simulation, fluid simulation, collision detection, and others is definitely important. Numerous attempts has been introduced in order to develop nearly perfect virtual environment but at the end the solution only cater for some specific settings that must be implemented before we properly visualize the virtual environment. In this paper, we consider few elements that can be used to visualize their virtual environment and perhaps becoming a common visualization procedure to differentiate and compare with others

Distance Computation using Axis Aligned Bounding Box (AABB) Parallel Distribution of Dynamic Origin Point

Performing accurate and precise collision detection method be-tween objects in virtual environment application such as computer games and medical simulation is important in computer graphics research and development. Given pair of objects that near colliding, numerous mechanic has been developed by researchers in order to minimize computation time and increase accuracy of the detection. However, most of these techniques required a lot of computational cost, extra processing power and complex algebraic equations just to solve distance between near colliding objects. In this paper, we described an alternate technique, which is a theoretical framework of novel technique in order to find the optimum closest distance between two or more convex polyhedral in virtual environment application. Given pair of near colliding objects, we proposed an easy to implement mechanism using dynamic origin point by creating inner and middle Axis Aligned Bounding-Box just to find closest distance between objects. We believed that the technique is suitable to be used in any game engine tools for computer games and medical simulation

Quad Separation Algorithm for Bounding-Volume Hierarchies Construction in Virtual Environment Application

In order to perform fast collision detection technique in Virtual Environment Application, researchers need to maintain the behaviour of the object itself before the objects come into contact. By enhancing the speed of intersection using Bounding-Volume Hierarchies technique, it helps to reduce the complexity and speed up the intersection process. Thus, in this paper we presented our novel algorithm for constructing Bounding-Volume Hierarchies using Quad Splitting method. Together with the Quad Splitting method is the implementation of Spatial Object Median Splitting technique (SOMS) in order to create a well-balanced tree for the object. We believed the key of performing fast intersection between two or more objects in Virtual Environment Application required a well-balanced and proper tree technique for Bounding-Volume hierarchies

Efficient normal cone culling method for collision detection of deformable model

학위논문 (석사) -- 서울대학교 대학원 : 공과대학 전기·정보공학부, 2020. 8. 고형석.강체 시뮬레이션과 달리 변형이 가능한 물체의 시뮬레이션 (직물 시뮬레이션)에서는 같은 물체 안에서 모든 삼각형 쌍의 충돌 탐지를 해야 하므로 매우 많은 시간이 소모된다. 이러한 이유로 현재 그래픽기술과 하드웨어를 이용하여 실시간으로 사실적인 물리 기반 직물 시뮬레이션을 만들어 내는 데 많은 어려움을 겪고 있다. 이에 따라 변형 가능한 물체 시뮬레이션에서의 충돌 탐지 시간을 줄이기 위해서 많은 가속화 연구들이 진행되어 왔다. 본 논문에서 제안하는 방법은 충돌 탐지 시간을 줄이기 위한 연구 중 직물의 표면 법선 벡터를 이용하여 충돌 탐지 연산을 줄이는 방법에서 영감을 받아 진행되었다. 본 논문에서는 기존에 제시된 표면 법선 벡터를 이용하는 방법에서 나아가 좀 더 효율적으로 표면 법선 벡터를 이용하여 충돌 탐지 시간을 줄이는 방법을 제시한다. 본 논문에서 제시하는 방법은 불연속 충돌 탐지에도 적용이 가능하고 연속 충돌 탐지에도 이용이 가능하다. 또한 연속 충돌 탐지에 적용할 때는 특히 동적인 장면에서 본 논문에서 제시한 방법이 좋은 효율을 보인다. 결론적으로 논문에서 소개한 방법은 기존의 방법에 비해 충돌 검사를 진행해야 하는 삼각형 쌍의 개수가 10~40% 감소하는 결과를 보였다. 본 논문의 방법은 이진 트리 구성하는 시간에서 트레이드 오프가 발생하나 전체적으로 봤을 때 성능 향상이 있다.Unlike rigid body simulation, the simulation of deformable model (fabric simulation) require collision detection of all triangle pairs within the same object, which takes a great deal of time. For this reason, it is difficult to create realistic physical-based deformable mode simulation in real time using current graphic technology and hardware. Accordingly, many acceleration studies have been conducted to reduce collision detection time in deformable model simulation. The method proposed in this paper was inspired by a study to reduce the collision detection operation using the surface normal vector of the fabric. In this paper, we develop an existing method using a surface normal vector and propose a method to efficiently reduce collision detection time using a surface normal vector. The method presented in this paper can be applied to both discrete collision detection and continuous collision detection. When applied to continuous collision detection, the method presented in this paper shows good performance, especially in dynamic scenes. As a result, the method introduced in the paper showed a 10-40% reduction in the number of triangle pairs that need to be tested for collisions compared to the existing method. In the method of this paper, trade-off occurs at the time of constructing the binary tree, but there is an improvement in performance as a whole.제 1 장 서론 1 제 1 절 용어 설명 1 제 2 장 관련 연구 3 제 1 절 불연속 충돌 탐지에서의 법선 원뿔 컬링 방법 3 제 2 절 연속 충돌 탐지에서의 법선 원뿔 컬링 방법 5 제 3 절 3차원 벡터들을 감싸는 최적의 경계 원뿔 7 제 3 장 개요 8 제 1 절 법선 원뿔 트리 형성 방법 8 제 2 절 법선 원뿔 트리를 이용한 컬링 방법 9 제 4 장 법선 원뿔 구성 방법 11 제 1 절 병합 방법 11 제 2 절 효율적인 연속 충돌 법선 원뿔 구성 방법 13 제 5 장 결과 17 제 1 절 실제 시뮬레이션 결과 모습 17 제 2 절 충돌 탐지 효율 18 제 6 장 결론 24 제 1 절 연구 의의 24 제 2 절 한계점 및 추후연구 24 참고문헌 26 Abstract 28Maste

Fast and exact continuous collision detection with Bernstein sign classification

We present fast algorithms to perform accurate CCD queries between triangulated models. Our formulation uses properties of the Bernstein basis and Bézier curves and reduces the problem to evaluating signs of polynomials. We present a geometrically exact CCD algorithm based on the exact geometric computation paradigm to perform reliable Boolean collision queries. Our algorithm is more than an order of magnitude faster than prior exact algorithms. We evaluate its performance for cloth and FEM simulations on CPUs and GPUs, and highlight the benefits