Please use this identifier to cite or link to this item: http://localhost:8081/jspui/handle/123456789/20889
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPawar, Prateek Shamprasad-
dc.date.accessioned2026-05-11T06:00:34Z-
dc.date.available2026-05-11T06:00:34Z-
dc.date.issued2021-06-
dc.identifier.urihttp://localhost:8081/jspui/handle/123456789/20889-
dc.guideSwain, A.K.en_US
dc.description.abstractWith increasing Product Data Management Databases' size with thousands of assemblies having hundreds of parts, the search and retrieval of necessary assembly is becoming difficult. Older approaches like filenames or finding similar assemblies are not sufficient in this new scenario. This thesis addresses the problem of Content-based assembly retrieval from the existing database. The algorithm uses a Graph data structure for storing the information about the parts and their kinematic connections in a given assembly. The method uses a unique tag-based assembly retrieval. The graph of any database assembly is searched for tags which are pre-defined graphs for generally used sub-assemblies using exact graph matching algorithm. The assembly database is converted into a document containing information about the presence and frequency of various tags in the assemblies. The end-user can search with the frequency of different tags in the system, giving them direct access to the most relevant database assemblies as per the search parameters. Because of text-based search usage, the proposed method reduces the time required to retrieve the assembly to about a fraction of seconds.en_US
dc.language.isoenen_US
dc.publisherIIT Roorkeeen_US
dc.subjectCAD assembly retrieval, content-based search, tagging, search, graph matching, database mappingen_US
dc.titleTag-based CAD assembly model retrieval for design reuseen_US
dc.typeDissertationsen_US
Appears in Collections:MASTERS' THESES (MIED)

Files in This Item:
File Description SizeFormat 
19538009_Prateek Shamprasad Pawar.pdf1.92 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.