View : 23 Download: 0

k-IOS: Intersection of spheres for efficient proximity query

Title
k-IOS: Intersection of spheres for efficient proximity query
Authors
Zhang X.Kim Y.J.
Ewha Authors
김영준
SCOPUS Author ID
김영준scopus
Issue Date
2012
Journal Title
Proceedings - IEEE International Conference on Robotics and Automation
ISSN
1050-4729JCR Link
Citation
pp. 354 - 359
Indexed
SCOPUS scopus
Abstract
We present a new bounding volume structure, k-IOS that is an intersection of k spheres, for accelerating proximity query including collision detection and Euclidean distance computation between arbitrary polygon-soup models that undergo rigid motion. Our new bounding volume is easy to implement and highly efficient both for its construction and runtime query. In our experiments, we have observed up to 4.0 times performance improvement of proximity query compared to an existing well-known algorithm based on swept sphere volume (SSV) [1]. Moreover, k-IOS is strictly convex that can guarantee a continuous gradient of distance function with respect to object's configuration parameter. © 2012 IEEE.
DOI
10.1109/ICRA.2012.6224889
ISBN
9781467314039
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

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

BROWSE