7,183 research outputs found
MKtree: generation and simulations
The problem to represent very complex systems has been studied by
several authors, obtaining solutions based on different data
structures. In this paper, a K dimensional tree
(Multirresolution Kdtree, MKtree) is introduced. The MKtree represents
a hierarchical subdivision of the scene objects that guarantees a
minimum space overlap between node regions. MKtrees are useful for
collision detection and for time-critical rendering in very large
environments requiring external memory storage. Examples in ship
design applications are described.Postprint (published version
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
Quad Axis Separation Framework for Bounding-Volume Hierarchies Construction
The construction of Bounding-Volume Hierarchies (BVH) for Virtual Environment application has been varied from
the rigid bodies application type to the deformable bodies application. Numerous technique and specific instruction has been
given from several researchers in order to make sure that the BVH can suite their application without any restriction. In this
paper, we explore the capability of BVH using a technique called Quad Axis Separation Technique (QAS) that could efficiently create full-blown hierarchical tree using approximation of separating axes theorem for Virtual Environment. A theoretical implementation is carried out with standard experimental that is also been used by researcher to test their BVH in the Virtual Environment. We also believed that QAS could provide fast and efficient hierarchical tree construction and also enhance the
speed and accuracy of the collision detection technique
The Construction of Balanced Bounding-Volume Hierarchies using Spatial Object Median Splitting Method for Collision Detection
Finding two or more contact points between rigid bodies simulation is always a fundamental task in virtual environment. Furthermore, the contact point needs to be accurately reported as soon as possible within 30-60 frames per second (fps) between moving polyhedral. This article introduced an efficient splitting method that is able to divide the bounding-volume of Axis Aligned Bounding-Box (AABB) hierarchies into a balanced tree. The construction of well-balanced tree will helps to improve the speed of the intersection between rigid bodies’ objects
Bounding Volume Hierarchies for Collision Detection
In virtual environment world, performing collision detection between various 3D objects requires sophisticated steps to be followed in order to properly visualize their effect. It is challenging due to the fact that multiple objects undergo various motion depending on the application’s genre. It is however an essential challenge to be resolved since it’s many use in the computer animation, simulation and robotic industry. Thus, object intersection between rigid bodies has become one of the most important areas in order to bring realism to simulation and animation
Bounding Volume Hierarchies for Collision Detection
In virtual environment world, performing collision detection between various 3D objects requires sophisticated steps to be followed in order to properly visualize their effect. It is challenging due to the fact that multiple objects undergo various motion depending on the application’s genre. It is however an essential challenge to be resolved since it’s many use in the computer animation, simulation and robotic industry. Thus, object intersection between rigid bodies has become one of the most important areas in order to bring realism to simulation and animation
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 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
- …