Show simple item record

contributor authorRaymond C. W. Sung
contributor authorDoug E. R. Clark
contributor authorJonathan R. Corney
date accessioned2017-05-09T00:04:17Z
date available2017-05-09T00:04:17Z
date copyrightDecember, 2001
date issued2001
identifier issn1530-9827
identifier otherJCISB6-25910#291_1.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/124860
description abstractThis paper describes a system for the automatic recognition of assembly features and the generation of disassembly sequences. The paper starts by reviewing the nature and use of assembly features. One of the conclusions drawn from this survey is that the majority of assembly features involve sets of spatially adjacent faces. Two principle types of adjacency relationships are identified and an algorithm is presented for identifying assembly features which arise from “spatial” and “contact” face adjacency relationships (known as s-adjacency and c-adjacency respectively). The algorithm uses an octree representation of a B-rep model to support the geometric reasoning required to locate assembly features on disjoint bodies. A pointerless octree representation is generated by recursively sub-dividing the assembly model’s bounding box into octants which are used to locate: 1. Those portions of faces which are c-adjacent (i.e. they effectively touch within the tolerance of the octree). 2. Those portions of faces which are s-adjacent to a nominated face. The resulting system can locate and partition spatially adjacent faces in a wide range of situations and at different resolutions. The assembly features located are recorded as attributes in the B-rep model and are then used to generate a disassembly sequence plan for the assembly. This sequence plan is represented by a transition state tree which incorporates knowledge of the availability of feasible gripping features. By way of illustration, the algorithm is applied to several trial components
publisherThe American Society of Mechanical Engineers (ASME)
titleAutomatic Assembly Feature Recognition and Disassembly Sequence Generation
typeJournal Paper
journal volume1
journal issue4
journal titleJournal of Computing and Information Science in Engineering
identifier doi10.1115/1.1429931
journal fristpage291
journal lastpage299
identifier eissn1530-9827
keywordsAlgorithms
keywordsOctrees
keywordsProject tasks AND Tree (Data structure)
treeJournal of Computing and Information Science in Engineering:;2001:;volume( 001 ):;issue: 004
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record