完整後設資料紀錄
DC 欄位語言
dc.contributor.authorFahn, Chin-Shyurng
dc.contributor.authorWang, Jui-Lung
dc.date.accessioned2009-08-23T04:40:09Z
dc.date.accessioned2020-05-25T06:24:34Z-
dc.date.available2009-08-23T04:40:09Z
dc.date.available2020-05-25T06:24:34Z-
dc.date.issued2006-10-16T07:04:33Z
dc.date.submitted1998-12-17
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/1632-
dc.description.abstractThis paper presents an efficient discrete-time collision detection procedure for polyhedral objects that consist of convex polygons and perform arbitrary translating and/or rotating motions in a 3-D graphical environment. The discrete-time collision detection procedure can find the exact position of a collision event for a time step, which first localized the object-to object collision events with a "space cell" method, An "azimuth-elevation map" method is then proposed to rapidly select the polygons within or across the overlap region between two possibly collided objects by presorting their vertices in the spherical coordinated system.Subsequently, a divide-and-conquer method that takes advantage of bounding box representation is devised to moderate the number of polygons needed to be checked by a polygon-to-polygon intersection test. To deal with the discrete-time collision detection, a polygon-to-polygon intersection testing method based on a hierarchical scheme is developed to diminish unnecessary computation. So far, the experimental results from our proposed methods are very encouraging
dc.description.sponsorship成功大學,台南市
dc.format.extent7p.
dc.format.extent624584 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries1998 ICS會議
dc.subject.otherAnimation
dc.titleEfficient discrete-time collision detection among polyhedral objects in arbitrary motion
分類:1998年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics001998000011.pdf609.95 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。