Recognition of Polymoprhic Patterns in Parameterized Graphs for 3D Building Reconstruction

摘要

An approach for the recongition of polymoprhic patterns by subgraph isomorphism computation of parameterized graphs will be presented. Parameterized graphs (short: p-graphs) are extensions of un- directed graphs by parameter vectors at the nodes and edges. We will define p-graphs and basic con- cepts of subgraph isomorphism computation for p-graphs. A bottom-up algorithm for p-subgraph isomoprhism computation according to a given search graph and a template graph will be described. Since the enumeration of all induced p-subgraphs require tremendous effort, we will propose four Pruning mechanisms in order to reduce the size of the search space.