ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer-Aided Design
Volume 40, Issue 2, February 2008, Pages 244-261
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (2461 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
Special issue
View Record in Scopus
 
doi:10.1016/j.cad.2007.10.012    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2007 Elsevier Ltd All rights reserved.

Content-based assembly search: A step towards assembly reuse

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abhijit S. Deshmukha, Ashis Gopal Banerjeea, Satyandra K. Guptaa, Corresponding Author Contact Information, E-mail The Corresponding Author and Ram D. Sriramb

aDepartment of Mechanical Engineering and The Institute for Systems Research, University of Maryland, College Park, MD 20742, USA

bManufacturing Systems Integration Division, National Institute of Standards and Technology, Gaithersburg, MD 20899, USA


Received 14 September 2006; 
accepted 29 October 2007. 
Available online 5 November 2007.

Abstract

The increased use of CAD systems by product development organizations has resulted in the creation of large databases of assemblies. This explosion of assembly data is likely to continue in the future. In many situations, a text-based search alone may not be sufficient to search for assemblies and it may be desirable to search for assemblies based on the content of the assembly models. The ability to perform content-based searches on these databases is expected to help the designers in the following two ways. First, it can facilitate the reuse of existing assembly designs, thereby reducing the design time. Second, a lot of useful designs for manufacturing, and assembly knowledge are implicitly embedded in existing assemblies. Therefore a capability to locate existing assemblies and examine them can be used as a learning tool by designers to learn from the existing assembly designs. This paper describes a system for performing content-based searches on assembly databases. We identify templates for comprehensive search definitions and describe algorithms to perform content-based searches for mechanical assemblies. We also illustrate the capabilities of our system through several examples.

Keywords: Content-based assembly search; Graph compatibility; Assembly mating conditions; Assembly characteristics

Article Outline

1. Introduction
2. System requirements
3. Selection and organization of search criteria
3.1. Assembly statistics and annotations
3.2. Constituent parts
3.3. Search based on part mating conditions
3.4. Joint orientation relationships
4. Checking compatibility of mating graphs
4.1. Definitions
4.2. Overview of algorithms
CompatibilityCheck (G 1, G 2)
MatchNode (p, q, matched_nodes_list, active_nodes_inG1, active_nodes_inG 2, G 1, G 2, matching_set)
4.3. Algorithm design rationale
4.4. Computational experiments: Results and discussions
5. Implementation and results
5.1. Implementation
5.2. Assembly search example # 1
5.3. Assembly search example # 2
5.4. Assembly search example # 3
5.5. Assembly search example # 4
5.6. Assembly search example # 5
6. Conclusions
Acknowledgements
References

















Corresponding Author Contact InformationCorresponding author.

Computer-Aided Design
Volume 40, Issue 2, February 2008, Pages 244-261
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.