Balanced hierarchical method of collision detection in virtual environment
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 p...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book Chapter |
| Language: | English |
| Published: |
Springer, 2011
2011
|
| Subjects: | |
| Online Access: | http://eprints.utem.edu.my/id/eprint/4084/1/fulltext.pdf http://eprints.utem.edu.my/id/eprint/4084/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|