The Experts below are selected from a list of 642 Experts worldwide ranked by ideXlab platform

Meng Jun - One of the best experts on this subject based on the ideXlab platform.

  • efficient approach based on hybrid Bounding volume hierarchy for real time collision detection
    Computer Simulation, 2008
    Co-Authors: Zhu Yuanfeng, Meng Jun
    Abstract:

    Oriented Bounding Box (OBB) hierarchy is a popular and efficient approach for accelerating collision detection (CD) among complex rigid models, but it can’t determine the contact status among objects far away as fast as other Bounding volumes (BVs), such as axis-aligned Bounding Boxes (AABB) or sphere BV, because each intersection test of OBBs is much more complex than that of others. Through a method of real-time collision detection using hybrid Bounding volume hierarchy (HBVH) with OBB and sphere BV, a fast intersection test was used to overlap test among two objects far away by using sphere vs. sphere test or sphere vs. OBB test, and also accurately determine the contact status among objects in closer proximity by OBB vs. OBB test. It is implemented and compared with other competitive algorithm of OBB. Experimental results prove that the HBVH algorithm is a precision and efficient approach for complex models in real-time collision detection.

Tomas Moller - One of the best experts on this subject based on the ideXlab platform.

  • optimized view frustum culling algorithms for Bounding Boxes
    Journal of Graphics Tools, 2000
    Co-Authors: Ulf Assarsson, Tomas Moller
    Abstract:

    Abstract This paper presents optimizations for faster view frustum culling (VFC) for axis-aligned Bounding Box (AABB) and Oriented Bounding Box (OBB) hierarchies. We exploit frame-to-frame coherency by caching and by comparing against previous distances and rotation angles. By using an octant test, we potentially halve the number of plane tests needed, and we also evaluate masking, which is a well-known technique. The optimizations can be used for arbitrary Bounding volumes, but we present only results for AABBs and OBBs. In particular, we provide solutions which are 2-11 times faster than other VFC algorithms for AABBs and OBBs, depending on the circumstances.

  • Optimized View Frustum Culling Algorithms for Bounding Boxes
    2000
    Co-Authors: Ulf Assarsson, Tomas Moller
    Abstract:

    This paper presents optimizations for faster view frustum culling (VFC) for axis aligned Bounding Box (AABB) and Oriented Bounding Box (OBB) hierarchies. We exploit frame-to-frame coherency by caching and by comparing against previous distances and rotation angles. By using an octant test, we potentially halve the number of plane tests needed, and we also evaluate masking, which is a well-known technique. The optimizations can be used for arbitrary Bounding volumes, but we only present results for AABBs and OBBs. In particular, we provide solutions which is 2 , 11 times faster than other VFC algorithms for AABBs and OBBs, depending on the circumstances. 1 Introduction Bounding volume hierarchies are commonly used to speed up the rendering of a scene by using a view frustum culling (VFC) algorithm on the hierarchy [Clark76]. Each node in the hierarchy has a Bounding volume (BV) that encloses a part of the scene. The hierarchy is traversed from the root, and if a BV is found ..

  • Optimized View Frustum Culling Algorithms for AABBs and OBBs
    1999
    Co-Authors: Ulf Assarsson, Tomas Moller
    Abstract:

    This paper presents optimizations for faster view frustum culling (VFC) for axis aligned Bounding Box (AABB) and Oriented Bounding Box (OBB) hierarchies. We exploit frame-to-frame coherency by caching and by comparing against previous distances and rotation angles. By using an octant test, we potentially halve the number of plane tests needed, and we also evaluate masking, which is a well-known technique. The optimizations can be used for arbitrary Bounding volumes 1 , but we only present results for AABBs and OBBs. In particular, we provide solutions which is 2; 2 \Gamma 11 times faster than other VFC algorithms for AABBs and OBBs, depending on the circumstances. 1 Introduction Bounding volume hierarchies are commonly used to speed-up the rendering of a scene by using a view frustum culling (VFC) algorithm on the hierarchy [Clark76]. Each node in the hierarchy has a Bounding volume (BV) that encloses a part of the scene. The hierarchy is traversed from the root, and if a ..

Samuel Melchior - One of the best experts on this subject based on the ideXlab platform.

  • Fast Oriented Bounding Box optimization on the rotation group SO(3, R
    2016
    Co-Authors: Chiatche Chang, Bastien Gorissen, Samuel Melchior
    Abstract:

    An exact algorithm to compute an optimal 3D Oriented Bounding Box was published in 1985 by Joseph O’Rourke, but it is slow and extremely hard to implement. In this article we propose a new approach, where the com-putation of the minimal-volume OBB is formulated as an unconstrained optimization problem on the rotation group SO(3,R). It is solved using a hybrid method combining the genetic and Nelder-Mead algorithms. This method is analyzed and then compared to the current state-of-the-art tech-niques. It is shown to be either faster or more reliable for any accuracy

  • fast Oriented Bounding Box optimization on the rotation group so 3 ℝ
    ACM Transactions on Graphics, 2011
    Co-Authors: Chiatche Chang, Bastien Gorissen, Samuel Melchior
    Abstract:

    An exact algorithm to compute an optimal 3D Oriented Bounding Box was published in 1985 by Joseph O'Rourke, but it is slow and extremely hard to implement. In this article we propose a new approach, where the computation of the minimal-volume OBB is formulated as an unconstrained optimization problem on the rotation group SO(3,ℝ). It is solved using a hybrid method combining the genetic and Nelder-Mead algorithms. This method is analyzed and then compared to the current state-of-the-art techniques. It is shown to be either faster or more reliable for any accuracy.

Zhu Yuanfeng - One of the best experts on this subject based on the ideXlab platform.

  • efficient approach based on hybrid Bounding volume hierarchy for real time collision detection
    Computer Simulation, 2008
    Co-Authors: Zhu Yuanfeng, Meng Jun
    Abstract:

    Oriented Bounding Box (OBB) hierarchy is a popular and efficient approach for accelerating collision detection (CD) among complex rigid models, but it can’t determine the contact status among objects far away as fast as other Bounding volumes (BVs), such as axis-aligned Bounding Boxes (AABB) or sphere BV, because each intersection test of OBBs is much more complex than that of others. Through a method of real-time collision detection using hybrid Bounding volume hierarchy (HBVH) with OBB and sphere BV, a fast intersection test was used to overlap test among two objects far away by using sphere vs. sphere test or sphere vs. OBB test, and also accurately determine the contact status among objects in closer proximity by OBB vs. OBB test. It is implemented and compared with other competitive algorithm of OBB. Experimental results prove that the HBVH algorithm is a precision and efficient approach for complex models in real-time collision detection.

Ulf Assarsson - One of the best experts on this subject based on the ideXlab platform.

  • optimized view frustum culling algorithms for Bounding Boxes
    Journal of Graphics Tools, 2000
    Co-Authors: Ulf Assarsson, Tomas Moller
    Abstract:

    Abstract This paper presents optimizations for faster view frustum culling (VFC) for axis-aligned Bounding Box (AABB) and Oriented Bounding Box (OBB) hierarchies. We exploit frame-to-frame coherency by caching and by comparing against previous distances and rotation angles. By using an octant test, we potentially halve the number of plane tests needed, and we also evaluate masking, which is a well-known technique. The optimizations can be used for arbitrary Bounding volumes, but we present only results for AABBs and OBBs. In particular, we provide solutions which are 2-11 times faster than other VFC algorithms for AABBs and OBBs, depending on the circumstances.

  • Optimized View Frustum Culling Algorithms for Bounding Boxes
    2000
    Co-Authors: Ulf Assarsson, Tomas Moller
    Abstract:

    This paper presents optimizations for faster view frustum culling (VFC) for axis aligned Bounding Box (AABB) and Oriented Bounding Box (OBB) hierarchies. We exploit frame-to-frame coherency by caching and by comparing against previous distances and rotation angles. By using an octant test, we potentially halve the number of plane tests needed, and we also evaluate masking, which is a well-known technique. The optimizations can be used for arbitrary Bounding volumes, but we only present results for AABBs and OBBs. In particular, we provide solutions which is 2 , 11 times faster than other VFC algorithms for AABBs and OBBs, depending on the circumstances. 1 Introduction Bounding volume hierarchies are commonly used to speed up the rendering of a scene by using a view frustum culling (VFC) algorithm on the hierarchy [Clark76]. Each node in the hierarchy has a Bounding volume (BV) that encloses a part of the scene. The hierarchy is traversed from the root, and if a BV is found ..

  • Optimized View Frustum Culling Algorithms for AABBs and OBBs
    1999
    Co-Authors: Ulf Assarsson, Tomas Moller
    Abstract:

    This paper presents optimizations for faster view frustum culling (VFC) for axis aligned Bounding Box (AABB) and Oriented Bounding Box (OBB) hierarchies. We exploit frame-to-frame coherency by caching and by comparing against previous distances and rotation angles. By using an octant test, we potentially halve the number of plane tests needed, and we also evaluate masking, which is a well-known technique. The optimizations can be used for arbitrary Bounding volumes 1 , but we only present results for AABBs and OBBs. In particular, we provide solutions which is 2; 2 \Gamma 11 times faster than other VFC algorithms for AABBs and OBBs, depending on the circumstances. 1 Introduction Bounding volume hierarchies are commonly used to speed-up the rendering of a scene by using a view frustum culling (VFC) algorithm on the hierarchy [Clark76]. Each node in the hierarchy has a Bounding volume (BV) that encloses a part of the scene. The hierarchy is traversed from the root, and if a ..