Assertion: dual graph | /r/HasAspect | edge
Facets:
value: between pairs of pixels
type: LOCATION
Source sentences:
text: The dual graph has an edge whenever two faces of G are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge.
text: The dual graph of this subdivision into squares has a vertex per pixel and an edge between pairs of pixels that share an edge; it is useful for applications including clustering of pixels into connected regions of similar colors.