Assertion: planar graph | /r/CapableOf | connect two sites
Facets:
value: by an edge
type: MANNER
Source sentences:
text: The dual of this diagram is the Delaunay triangulation of the input, a planar graph that connects two sites by an edge whenever there exists a circle that contains those two sites and no other sites.