Common Structure Mining of 3D Model Assembly Model Based on Frequent Subgraphs

Table 3

Symbol definitions.

Symbol	Definition
	Semantic node of part a
	Mating nodes between parts a and b
	A collection of all attribute adjacency graphs
	All preprocessed Atlas
	Set of K-order candidate frequent subgraphs
	Set of frequent subgraphs of order K
	Set of all frequent subgraphs,
id	In or , the address number corresponding to the subgraph
F	All vertex properties corresponding to the subgraph
M	The adjacency matrix corresponding to the property adjacency graph
	In the construction of K + 1 candidate subgraph, it is necessary to connect two k-order frequent subgraphs containing the same K − 1-order frequent subgraph, represents the address list of all K − 1-order frequent subgraphs, and is usually obtained when the candidate subgraph is generated
	If there is a subgraph isomorphism between a subgraph and a graph in , is used to store the address number of the graph in , and is usually obtained when frequent subgraphs are generated