On the role of graph theory apparatus in a cad modeling kernel

Abstract

This paper summarizes the experience of authors in solving a broad range of CAD modeling problems where the formalism of graph theory demonstrates its expressive power. Some results reported in this paper have never been published elsewhere. The set of topological and geometric heuristics backing the subgraph isomorphism algorithm is presented to achieve decent performance in our extensible feature recognition framework. By the example of sheet metal features, we show that using wise topological and geometric heuristics speeds up the search process up to interactive performance rates. For detecting CAD part's type, we present the connected components' analysis in the attributed adjacency graph. Our approach allows for identifying two-sided CAD parts, such as sheet metals, tubes, and flat plates. We use the notion of face transition graph for the unfoldability analysis. The basic operations on hierarchical assembly graphs are formalized in terms of graph theory for handling CAD assemblies. We describe instance singling operation that allows for addressing unique part's occurrences in the component tree of an assembly. The presented algorithms and ideas demonstrated their efficiency and accuracy in the bunch of industrial applications developed by our team.