Bounding-volume hierarchies for detecting object interference in urban simulation

• Main Authors: Bade, Abdullah, Daman, Daut
• Format: Conference or Workshop Item
• Published: 2009
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://eprints.utm.my/id/eprint/14888/; http://wikicfp.com/cfp/servlet/event.showcfp?eventid=6275&copyownerid=5815
• Institution: Universiti Teknologi Malaysia

Performing fast and accurate collision detection between geometric models always common and challenging problems in modeling, robotics, manufacturing and computer-simulated environments. Most of previous method seems to have their own specification and restricted to a specific geometric models. For example, convex polytopes tend to solve accuracy problems but left behind the speed of collision detection. In this paper, we present a Bounding-Volume Hierarchies (BVH) technique for collision detection between general polygonal models to be used in urban simulation. By using hierarchical approach, we believe that collision detection between static and dynamic object can be preferred in real-time and suitable to overcome the equipment of urban simulation. Our preliminary result shows that bounding-volume hierarchies achieve favourable frame-rates in real times simulation using binary tree. Our construction is faster than traditional method of constructing bounding-volume hierarchies. In practice, we can construct bounding-volume hierarchies for accurate and fast collision detection method in urban simulation.