View : 843 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author김영준*
dc.date.accessioned2016-08-28T11:08:45Z-
dc.date.available2016-08-28T11:08:45Z-
dc.date.issued2012*
dc.identifier.isbn9781467314039*
dc.identifier.issn1050-4729*
dc.identifier.otherOAK-13792*
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/229741-
dc.description.abstractWe 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.*
dc.languageEnglish*
dc.titlek-IOS: Intersection of spheres for efficient proximity query*
dc.typeConference Paper*
dc.relation.indexSCOPUS*
dc.relation.startpage354*
dc.relation.lastpage359*
dc.relation.journaltitleProceedings - IEEE International Conference on Robotics and Automation*
dc.identifier.doi10.1109/ICRA.2012.6224889*
dc.identifier.scopusid2-s2.0-84864450226*
dc.author.googleZhang X.*
dc.author.googleKim Y.J.*
dc.contributor.scopusid김영준(56223507100)*
dc.date.modifydate20240322133440*
Appears in Collections:
인공지능대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE