New Geometric Data Structures for Collision Detection
File | Description | Size | Format | |
---|---|---|---|---|
00102857-1.pdf | 41.3 MB | Adobe PDF | View/Open |
Other Titles: | Neue geometrische Datenstrukturen zur Kollisionsdetektion | Authors: | Weller, René | Supervisor: | Zachmann, Gabriel ![]() |
1. Expert: | Zachmann, Gabriel ![]() |
Experts: | Weber, Andreas | Abstract: | We present new geometric data structures for collision detection and more, including: Inner Sphere Trees - the first data structure to compute the peneration volume efficiently. Protosphere - an new algorithm to compute space filling sphere packings for arbitrary objects. Kinetic AABBs - a bounding volume hierarchy that is optimal in the number of updates when the objects deform. Kinetic Separation-List - an algorithm that is able to perform continuous collision detection for complex deformable objects in real-time. Moreover, we present applications of these new approaches to hand animation, real-time collision avoidance in dynamic environments for robots and haptic rendering, including a user study that exploits the influence of the degrees of freedom in complex haptic interactions. Last but not least, we present a new benchmarking suite for both, peformance and quality benchmarks, and a theoretic analysis of the running-time of bounding volume-based collision detection algorithms. |
Keywords: | Collision Detection; Geometric Data Structures; Haptics; Computer Graphics; Physically-based Simulation | Issue Date: | 18-Sep-2012 | Type: | Dissertation | Secondary publication: | no | URN: | urn:nbn:de:gbv:46-00102857-18 | Institution: | Universität Bremen | Faculty: | Fachbereich 03: Mathematik/Informatik (FB 03) |
Appears in Collections: | Dissertationen |
Page view(s)
1,265
checked on Apr 2, 2025
Download(s)
490
checked on Apr 2, 2025
Google ScholarTM
Check
Items in Media are protected by copyright, with all rights reserved, unless otherwise indicated.