New Geometric Data Structures for Collision Detection and Haptics

by René Weller

Overview

Starting with novel algorithms for optimally updating bounding volume hierarchies of objects undergoing arbitrary deformations, the author presents a new data structure that allows, for the first time, the computation of the penetration volume. The penetration volume is related to the water displacement of the overlapping region, and thus corresponds to a physically motivated and continuous force. The practicability of the approaches used is shown by realizing new applications in the field of robotics and haptics, including a user study that evaluates the influence of the degrees of freedom in complex haptic interactions. New Geometric Data Structures for Collision Detection and Haptics closes by proposing an open source benchmarking suite that evaluates both the performance and the quality of the collision response in order to guarantee a fair comparison of different collision detection algorithms.

Required in the fields of computer graphics, physically-based simulations, computer animations, robotics and haptics, collision detection is a fundamental problem that arises every time we interact with virtual objects. Some of the open challenges associated with collision detection include the handling of deformable objects, the stable computation of physically-plausible contact information, and the extremely high frequencies that are required for haptic rendering. New Geometric Data Structures for Collision Detection and Haptics presents new solutions to all of these challenges, and will prove to be a valuable resource for researchers and practitioners of collision detection in the haptics, robotics and computer graphics and animation domains.

Product Details

ISBN-13:	9783319010199
Publisher:	Springer International Publishing
Publication date:	07/15/2013
Series:	Springer Series on Touch and Haptic Systems
Edition description:	2013
Pages:	240
Product dimensions:	6.10(w) x 9.25(h) x 0.02(d)

Table of Contents

Series Editors’ Foreword.- Preface.- Part I – That was Then, This is Now.- Introduction.- A Brief Overview of Collision Detection.- Part II – Algorithms and Data Structures.- Kinetic Data Structures for Collision Detection.- Sphere Packings for Arbitrary Objects.- Inner Sphere Trees.- Part III – Evaluation and Application.- Evaluation and Analysis of Collision Detection Algorithms.- Applications.- Part IV – Every End is Just a New Beginning.- Epilogue.