Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/25088

Title: Haptic Collision Detection on Highly Complex Medical Data Structures
Authors: Pirotte, Niels
Vranken, Casper
Swinkels, Wout
Claesen, Luc
Sun, Yi
Politis, Constantinus
Issue Date: 2017
Publisher: IEEE Institute of Electrical and Electronics Engineers
Citation: Li, Qingli; Wang, Lipo; Zhou, Mei; Sun, Li; Qiu, Song; Liu, Hongying (Ed.). Proceedings 2017 10th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics CISP-BMEI 2017, IEEE Institute of Electrical and Electronics Engineers,p. 3B-7-3B-12
Status: In Press
Abstract: Nowadays, the planning procedure for orthognathic surgery consists of a manual workflow which relies on cost and time consuming tasks. The burden that this procedure has on the surgeon and the medical staff can be reduced by substituting the current procedure with a digital workflow. In the novel workflow the surgeon uses a haptic feedback device to mimic the haptic information perceived from the manual procedure. However, highly complex 3D medical scan models of the upper and lower jaw are needed to reproduce a realistic feeling. These complex models stress the need for an efficient collision detection algorithm to obtain the necessary update rate of at least 1 kHz for haptic feedback devices. In this paper the potential of the Inner Sphere Tree (IST) data structure is analyzed for application in the orthognathic surgery digital planning workflow. An open-source C++ program is developed on the CHAI3D platform for the implementation and evaluation of the IST. For the evaluation, the detection speed, but also the accuracy of the collision detection, in terms of the error introduced by the proximity of the minimum distance between bounding volume hierarchies (BVHs), are taken into consideration. Various tree traversal algorithms, distance and backtracking, are implemented and evaluated. Finally, a multi-point tree traversal algorithm is developed to find multiple contact-points between two ISTs. Due to the added optimizations and by using these tree traversal algorithms, the required update speed is reached.
URI: http://hdl.handle.net/1942/25088
ISBN: 9781538619360
Category: C1
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Published version1.58 MBAdobe PDF
Proof of peer review256.68 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.