김영준
2017-08-28T22:35:13Z
2017-08-28T22:35:13Z
2012
0730-0301
OAK-8491
http://dspace.ewha.ac.kr/handle/2015.oak/222385
We present a real-time algorithm that finds the Penetration Depth (PD) between general polygonal models based on iterative and local optimization techniques. Given an in-collision configuration of an object in configuration space, we find an initial collision-free configuration using several methods such as centroid difference, maximally clear configuration, motion coherence, random configuration, and sampling-based search. We project this configuration on to a local contact space using a variant of continuous collision detection algorithm and construct a linear convex cone around the projected configuration.We then formulate a new projection of the in-collision configuration onto the convex cone as a Linear Complementarity Problem (LCP), which we solve using a type of Gauss-Seidel iterative algorithm.We repeat this procedure until a locally optimal PD is obtained. Our algorithm can process complicated models consisting of tens of thousands triangles at interactive rates. © 2012 ACM.
English
PolyDepth: Real-time penetration depth computation using iterative contact-space projection
Article
1
31
SCI
SCIE
SCOPUS
ACM Transactions on Graphics
10.1145/2077341.2077346
WOS:000300622500005
2-s2.0-84863289955
Je C.
Tang M.
Lee Y.
Lee M.
Kim Y.J.
김영준(56223507100)
20170922131523