Graph topological transformations in space-filling cell aggregates
Fig 2
A The hierarchical structure of GVM vertex→edge→polygon→cell is defined by a metagraph. Relationships between these nodes are labeled IS_PART_OF and carry a sign property denoted by s, σ, and Σ for vertex→edge, edge→polygon, and polygon→cell relationships, respectively. B A subgraph representing a particular local cell state is obtained by pattern matching. This subgraph is then transformed by a graph transformation. C Metagraph of graph-transformation graph connects Vertex, Edge, Polygon, and Cell nodes with green and red relationships, indicating creation and deletion of IS_PART_OF relationships in the GVM’s knowledge graph, respectively.