View : 15 Download: 0

D-plan: Efficient collision-free path computation for part removal and disassembly

Title
D-plan: Efficient collision-free path computation for part removal and disassembly
Authors
Zhang L.Huang X.Kim Y.J.Manocha D.
Ewha Authors
김영준
SCOPUS Author ID
김영준scopus
Issue Date
2008
Journal Title
Computer-Aided Design and Applications
ISSN
1686-4360JCR Link
Citation
vol. 5, no. 6, pp. 774 - 786
Indexed
SCOPUS scopus
Abstract
We present a novel approach to compute a collision-free path for part disassembly simulation and virtual prototyping of part removal. Our algorithm is based on sample-based motion planning that connects collision-free samples in the configuration space using local planning. In order to effectively handle the tight-fitting scenarios, we describe techniques to generate samples in narrow passages and efficient local planning algorithms to connect them with collision-free paths. Our approach is general and makes no assumption about model connectivity or object topology, and can handle polygon soup models that frequently arise in CAD applications. We highlight the performance on many challenging benchmarks including the Alpha puzzle, maintainability of the windscreen wiper motion, and disassembly of a seat from the interior of a car body. © 2008 CAD Solutions, LLC.
DOI
10.3722/cadaps.2008.774-786
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