scispace - formally typeset
Journal ArticleDOI

Generic face adjacency graph for automatic common design structure discovery in assembly models

Reads0
Chats0
TLDR
A generic face adjacency graph (GFAG) is proposed which is extended from the face adjACency graph for B-Rep part model description and can take more geometric information, together with topological information, into account quantitatively, and thus can be mapped into a 2D coordinate system for easy validation.
Abstract
Common Design Structure Discovery (CDSD) is to identify local structures shared by multiple models. Nowadays it is mainly restricted to part models. Extending it to assembly models can produce a significant value for assembly design reuse. However, current descriptions of assembly models usually capture topological information qualitatively, considering little geometric information, and thus are not suitable for CDSD in assembly models (CDSDA). To counter this problem, this paper proposes a generic face adjacency graph (GFAG) which is extended from the face adjacency graph for B-Rep part model description. GFAG can transform abstract relationships in assembly models into measurable entities by introducing a concept of mating face pair (MFP), thus facilitating a more quantitative and consistent description of parts and relationships in assembly models. Corresponding to geometric faces and edges in a part model, GFAG treats parts and relationships in an assembly model as generic faces and generic edges respectively. To make GFAG have a higher discrimination capability, a node in GFAG captures the geometric information of a part together with its mating parts by shape parameters and also quantitatively incorporates a relationship between parts by shape parameters of an MFP. By doing so, GFAG can take more geometric information, together with topological information, into account quantitatively, and thus can be mapped into a 2D coordinate system for easy validation. We also extend a discovery algorithm to validate the feasibility of GFAG for CDSDA, and the results demonstrate the expected effectiveness.

read more

Citations
More filters

Content-Based Assembly Search: A Step Towards Assembly Reuse | NIST

TL;DR: This paper describes a system for performing content-based searches on assembly databases, identifies templates for comprehensive search definitions and describes algorithms to perform content- based searches for mechanical assemblies.
Journal ArticleDOI

Content-based CAD assembly model retrieval: Survey and future challenges

TL;DR: The user requirements for CAD assembly model retrieval are highlighted and a set of criteria for analyzing the available methods grouped into the following macro-categories: objective, assembly characterization, assembly descriptor, query specification and type of similarity are proposed.
Journal ArticleDOI

An assembly retrieval approach based on shape distributions and Earth Mover’s Distance

TL;DR: An assembly retrieval approach based on shape distributions and Earth Mover’s Distance (EMD) is proposed, which concerns the shape information rather than the high-level information of assembly model, which gives the user a simpler way to retrieve assemblies.
Journal ArticleDOI

CAD assembly model retrieval based on multi-source semantics information and weighted bipartite graph

TL;DR: A semantic-based assembly retrieval prototype system is developed, a semantic matching model is built based on weighted bipartite graph for solving the many-to-many semantics matching problem of semantic retrieval for CAD assembly models.
Journal ArticleDOI

Multi-criteria retrieval of CAD assembly models

TL;DR: A method to characterize and structure CAD assembly models to enable the retrieving of similar models from a database according to multiple user-specified search criteria is proposed and results obtained from the developed software prototype are illustrated.
References
More filters
Proceedings ArticleDOI

Topology matching for fully automatic similarity estimation of 3D shapes

TL;DR: A novel technique is proposed, called Topology Matching, in which similarity between polyhedral models is quickly, accurately, and automatically calculated by comparing Multiresolutional Reeb Graphs (MRGs), which operates well as a search key for 3D shape data sets.
Journal ArticleDOI

Shock graphs and shape matching

TL;DR: A novel tree matching algorithm is introduced which finds the best set of corresponding nodes between two shock trees in polynomial time and is demonstrated under articulation, occlusion, and moderate changes in viewpoint.
Proceedings ArticleDOI

Skeleton based shape matching and retrieval

TL;DR: The method encodes the geometric and topological information in the form of a skeletal graph and uses graph matching techniques to match the skeletons and to compare them and also describes a visualization tool to aid in the selection and specification of the matched objects.
Journal ArticleDOI

Three-dimensional shape searching: state-of-the-art review and future trends

TL;DR: This paper classify and compare various 3D shape searching techniques based on their shape representations and identifies gaps in current shape search techniques and identifies directions for future research.
Journal ArticleDOI

State of the art of graph-based data mining

TL;DR: This article introduces the theoretical basis of graph based data mining and surveys the state of the art of graph-based data mining.
Related Papers (5)