Flag Complex
Given any graph, the flag complex (or clique complex) is the maximal simplicial complex containing a graph as its 1-skeleton. Otherwise said, whenever there appears to be the boundary of a simplex, one fills it in.
The Vietoris-Rips complex is the flag complex associated with the distance-$\varepsilon$ proximity graph of a point cloud vertex set $\Omega$.
|
|
page revision: 4, last edited: 17 Aug 2023 04:10