View : 19 Download: 0

Efficient distance computation in configuration space

Title
Efficient distance computation in configuration space
Authors
Zhang L.Kim Y.J.Manocha D.
Ewha Authors
김영준
SCOPUS Author ID
김영준scopus
Issue Date
2008
Journal Title
Computer Aided Geometric Design
ISSN
0167-8396JCR Link
Citation
vol. 25, no. 7, pp. 489 - 502
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
We address the problem of computing a measure of the distance between two configurations of a rigid or an articulated model. The underlying distance metric is defined as the maximum length of the displacement vectors over the vertices of the model between two configurations. Our algorithm is based on Chasles theorem from Screw theory, and we show that for a rigid model the maximum distance is realized by one of the vertices on the convex hull of the model. We use this formulation to compute the distance, and present two acceleration techniques: incremental walking on the dual space of the convex hull and culling vertices on the convex hull using a bounding volume hierarchy (BVH). Our algorithm can be easily extended to articulated models by maximizing the distance over its each link and we also present culling techniques to accelerate the computation. We highlight the performance of our algorithm on many complex models and demonstrate its applications to generalized penetration depth computation and motion planning. © 2008 Elsevier B.V. All rights reserved.
DOI
10.1016/j.cagd.2008.04.005
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